{"id":"W2161452897","doi":"10.1109/icc.2008.828","title":"OFDMA Based Two-Hop Cooperative Relay Network Resources Allocation","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Computer network; Base station; Quality of service; Computational complexity theory; Synchronization (alternating current); Link Access Procedure for Frame Relay; Resource allocation; Integer programming; Relay channel; Distributed computing; Algorithm; Channel (broadcasting)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003607711,0.0001551185,0.0001629821,0.00006799827,0.0007435829,0.0001084213,0.0009788382,0.00004592735,0.0002199843],"category_scores_gemma":[0.0000534524,0.0001325533,0.00005464676,0.000888986,0.00009475648,0.000380465,0.0002867512,0.0001884254,0.0001179384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004588359,"about_ca_system_score_gemma":0.0001082238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001480083,"about_ca_topic_score_gemma":0.00009839793,"domain_scores_codex":[0.9985657,0.0003357361,0.000262668,0.0003422739,0.000227295,0.0002663282],"domain_scores_gemma":[0.9984565,0.0002515522,0.00008435107,0.000818439,0.0002881782,0.0001009948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005268964,0.0003883344,0.008988193,0.00001014256,0.00009987845,0.00003363189,0.007857949,0.3782885,0.003766958,0.3763011,0.135612,0.08860064],"study_design_scores_gemma":[0.0006898571,0.00007790394,0.004069817,0.0000421631,0.000004401693,0.00001119261,0.00002506615,0.9090576,0.001697962,0.0001079497,0.08389959,0.0003164619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03114372,0.001338645,0.9300376,0.00829529,0.0002781125,0.0002873293,5.897033e-7,0.000517774,0.02810099],"genre_scores_gemma":[0.9450919,0.0006323134,0.04689403,0.003866717,0.0001625916,0.00005112181,0.000006322301,0.00001107213,0.003283925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9139482,"threshold_uncertainty_score":0.5719113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04219592248171936,"score_gpt":0.2701493403974931,"score_spread":0.2279534179157737,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}