{"id":"W2235552839","doi":"","title":"Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes","year":2009,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Computer science; Max-min fairness; Mathematical optimization; Resource allocation; Power control; Maximization; Relay; Heuristic; Throughput; Power (physics); Admission control; Wireless network; Resource management (computing); Computer network; Wireless; Mathematics; Telecommunications; Quality of service","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.002482806,0.0009045532,0.00153143,0.0004391301,0.000590785,0.001817054,0.001539643,0.001245318,0.0009168412],"category_scores_gemma":[0.004548236,0.0004922908,0.0006315546,0.0008700308,0.001456625,0.001841349,0.001495667,0.001668338,0.0002479415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001474027,"about_ca_system_score_gemma":0.001390859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002097314,"about_ca_topic_score_gemma":0.001475289,"domain_scores_codex":[0.9980191,0.001123999,0.00004780315,0.0001957408,0.0004232121,0.0001901911],"domain_scores_gemma":[0.9977652,0.001633949,0.0001763137,0.0001502206,0.000183267,0.00009106057],"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.00008224291,0.00005690409,0.0001711012,0.00004295313,0.0000234232,0.0000473457,0.00007725874,0.9310275,0.0009883456,0.03534369,0.0007157483,0.03142343],"study_design_scores_gemma":[0.000007254429,0.00001015276,0.00001873621,0.000002244385,0.000002587672,0.000006170997,0.000006027591,0.9927567,0.0001911558,0.006895353,0.000100869,0.000002878798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01062825,0.0003474328,0.9866545,0.0002882364,0.00002056379,0.00002643355,0.00001068609,0.0001101374,0.001913711],"genre_scores_gemma":[0.8646095,0.0005596653,0.1322886,0.0001151804,0.0001043678,0.0001716234,0.00003310985,0.00005573491,0.002062185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002482806,"threshold_uncertainty_score":0.01313049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01044467239743218,"score_gpt":0.25140367964663,"score_spread":0.2409590072491978,"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."}}