{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001149116,0.0009091227,0.0006846991,0.0006116495,0.000430003,0.0009293052,0.0008892356,0.001061762,0.0004595654],"category_scores_gemma":[0.00361393,0.000514937,0.0002544859,0.001035505,0.001528763,0.001027094,0.0009103201,0.0004419753,0.0001711426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044083,"about_ca_system_score_gemma":0.0005236017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001820362,"about_ca_topic_score_gemma":0.001550148,"domain_scores_codex":[0.99889,0.0006427011,0.00002490572,0.0001089527,0.0001840457,0.0001494439],"domain_scores_gemma":[0.9987901,0.0008821455,0.0001285163,0.00006225971,0.00009189532,0.00004512206],"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.0000424456,0.00002038832,0.0002646621,0.00001982244,0.00001156126,0.00009913317,0.00008613365,0.9749916,0.00157179,0.01244712,0.0002445389,0.01020082],"study_design_scores_gemma":[0.00001213069,0.00003114825,0.00006255025,0.00000286827,0.000006543189,0.00002859469,0.00002398094,0.9864638,0.0005849471,0.01256482,0.0002134502,0.000005076545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09369804,0.0006310047,0.902118,0.0002854669,0.00001724861,0.00004422965,0.00003392233,0.0001211721,0.003050947],"genre_scores_gemma":[0.9630684,0.000500957,0.03508261,0.00004897802,0.0000276457,0.00007939242,0.00002387579,0.00001981661,0.001148256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001820362,"threshold_uncertainty_score":0.007575393,"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."}}