{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003095473,0.0002471208,0.0003953603,0.0003488004,0.000179681,0.00007984396,0.0006366177,0.0003297633,0.000004557796],"category_scores_gemma":[0.0002247036,0.000231279,0.00004102323,0.0009935783,0.0003155657,0.0005320118,0.0002590314,0.0004341339,0.000001086213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006489308,"about_ca_system_score_gemma":0.00005324644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004209485,"about_ca_topic_score_gemma":0.00002879386,"domain_scores_codex":[0.9984855,0.00007550974,0.0004224296,0.0004739212,0.0001644076,0.0003782139],"domain_scores_gemma":[0.9987283,0.00004505408,0.0002229195,0.0007204039,0.0001612863,0.0001220166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001731408,0.0007359639,0.0659381,0.00004180577,0.0001509819,0.00005325923,0.000846696,0.001261878,0.02054238,0.1337105,0.001059369,0.7754859],"study_design_scores_gemma":[0.009600921,0.0006864577,0.05784422,0.0006401241,0.00005297186,0.00007036526,0.0001043167,0.5382231,0.004654937,0.001384136,0.3856075,0.001130895],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1754431,0.006431471,0.7820401,0.03425424,0.0002144872,0.0009730671,0.000005841376,0.0005346904,0.0001030164],"genre_scores_gemma":[0.9665429,0.001186964,0.03191379,0.0002735149,0.000009037253,0.00002817502,0.00001467869,0.000008236847,0.00002269373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7910998,"threshold_uncertainty_score":0.9431282,"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."}}