{"id":"W2145623425","doi":"10.1109/icc.2009.5199285","title":"Optimal Relay Assignment and Power Allocation in Selection Based Cooperative Cellular Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Overhead (engineering); Heuristic; Base station; Mathematical optimization; Metric (unit); Upper and lower bounds; Relay channel; Channel allocation schemes; Channel (broadcasting); Optimization problem; Assignment problem; Quadratic assignment problem; Power (physics); Algorithm; Computer network; Mathematics; Wireless; Telecommunications; Engineering","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.0003534625,0.0001029063,0.00009955747,0.0000842571,0.000138958,0.0001329669,0.0002307907,0.00005171832,0.00004557125],"category_scores_gemma":[0.0000170483,0.00009414409,0.00001610852,0.0004816903,0.00001871498,0.0003144453,0.00006056538,0.0001634304,0.000004919641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007934053,"about_ca_system_score_gemma":0.00003994986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002764607,"about_ca_topic_score_gemma":0.00002331809,"domain_scores_codex":[0.9991173,0.000183399,0.000178965,0.0002535549,0.0001076152,0.0001591309],"domain_scores_gemma":[0.9995165,0.00006277824,0.00003962906,0.000239776,0.00008675222,0.00005459202],"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.00003072968,0.0003171027,0.001062003,0.00000175953,0.0000115078,0.000005379846,0.001201163,0.7372553,0.01422483,0.1854147,0.001693147,0.05878247],"study_design_scores_gemma":[0.0003382591,0.0001661295,0.006462005,0.00001535238,0.000001204674,0.000001423259,0.0000163853,0.9891908,0.00295327,0.00002191944,0.0007089306,0.0001242958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01765789,0.0002453117,0.9761739,0.003371582,0.00004841809,0.0001813419,5.040977e-8,0.00008007929,0.002241399],"genre_scores_gemma":[0.9679167,0.0001117189,0.03050641,0.001216923,0.00001362961,0.00001121963,0.000003263652,0.000003178819,0.0002169247],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9502589,"threshold_uncertainty_score":0.3839085,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01617125581405911,"score_gpt":0.2475727941306769,"score_spread":0.2314015383166178,"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."}}