{"id":"W1987577990","doi":"10.1109/bsc.2008.4563231","title":"Low complexity power allocation in multiple-antenna relay networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Telecommunications link; Relay; Computer science; Mathematical optimization; Maximization; Convergence (economics); Iterative method; Scheme (mathematics); Optimization problem; Power (physics); Algorithm; Computer network; Mathematics","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.0009696411,0.0004794992,0.0006734077,0.0002363453,0.0002547197,0.000777692,0.0005891001,0.0005861726,0.001280844],"category_scores_gemma":[0.003227288,0.0003282377,0.0001801731,0.0004641602,0.0006637628,0.000976911,0.000559672,0.0004743817,0.0002902201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005870039,"about_ca_system_score_gemma":0.0004298376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001043704,"about_ca_topic_score_gemma":0.001106465,"domain_scores_codex":[0.9993279,0.0003930533,0.00001196886,0.00006231172,0.0001404271,0.00006444642],"domain_scores_gemma":[0.9987841,0.001007629,0.00006321204,0.00005147908,0.00007560723,0.00001794193],"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.00007706437,0.00002008758,0.000222102,0.00004729315,0.00001558807,0.00006767664,0.00004665876,0.9373348,0.0022207,0.03520196,0.0006102023,0.02413583],"study_design_scores_gemma":[0.000008368866,0.00001533885,0.00003764481,0.000001885042,0.000002376664,0.00001384071,0.000006142416,0.9919204,0.0003033753,0.00743481,0.0002537333,0.000002166079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02691483,0.0007381527,0.9677113,0.0002032818,0.00003017045,0.00002368829,0.00001907331,0.0001149847,0.004244584],"genre_scores_gemma":[0.9167625,0.00053361,0.07786244,0.00006524731,0.00005697998,0.0000963947,0.00002530952,0.00003684824,0.004560689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001280844,"threshold_uncertainty_score":0.005128026,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08271486531406036,"score_gpt":0.2758539243331766,"score_spread":0.1931390590191163,"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."}}