{"id":"W1965321556","doi":"10.1155/2009/901965","title":"Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes","year":2009,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Aristotle University of Thessaloniki","keywords":"Computer science; Resource allocation; Mathematical optimization; Max-min fairness; Maximization; Power control; Relay; Heuristic; Throughput; Power (physics); Wireless network; Wireless; Computer network; Distributed computing; Telecommunications; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.00270319,0.001028974,0.001754644,0.0004805798,0.0006362355,0.002012071,0.001699402,0.001365276,0.0009382805],"category_scores_gemma":[0.004880621,0.00056712,0.0007481307,0.0009546521,0.00155009,0.001915003,0.001674762,0.001839264,0.0002625005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001573783,"about_ca_system_score_gemma":0.001463737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002153522,"about_ca_topic_score_gemma":0.001468478,"domain_scores_codex":[0.9978702,0.001198712,0.00005419569,0.0002152207,0.0004559307,0.0002056667],"domain_scores_gemma":[0.9975157,0.001825947,0.0001976978,0.0001578887,0.0002036708,0.00009909333],"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.00008324703,0.00005694251,0.0001726334,0.00004790816,0.00002574629,0.00005348208,0.00008131358,0.9351232,0.000972407,0.03449544,0.0007205808,0.02816704],"study_design_scores_gemma":[0.000006857736,0.00001003467,0.0000177859,0.000002322864,0.000002809258,0.000006527125,0.000005874768,0.9927894,0.0001741261,0.006887299,0.00009393124,0.00000299913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009793772,0.0003887823,0.9875776,0.000283862,0.00002219816,0.00002805724,0.00001107034,0.0001064298,0.001788339],"genre_scores_gemma":[0.8615759,0.0006637521,0.1351222,0.0001263491,0.0001157619,0.0001960188,0.0000367035,0.00006190623,0.002101506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00270319,"threshold_uncertainty_score":0.014296,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02425866292436651,"score_gpt":0.2838015596840111,"score_spread":0.2595428967596446,"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."}}