{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009600847,0.0002321678,0.0003209521,0.0001499347,0.0009150301,0.0005211754,0.0007544927,0.0001115896,0.000003336288],"category_scores_gemma":[0.00003472379,0.0002077923,0.00004241881,0.0004871918,0.0001358871,0.0004539239,0.0003053705,0.0008115017,5.458141e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006041974,"about_ca_system_score_gemma":0.0000332856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002093892,"about_ca_topic_score_gemma":0.00001415062,"domain_scores_codex":[0.9979851,0.0006496733,0.0005357345,0.0002986171,0.0001700792,0.0003608183],"domain_scores_gemma":[0.9980074,0.0004751805,0.0003010688,0.0008124865,0.0001477455,0.0002561159],"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.00007819756,0.0002289346,0.01355865,0.000004404362,0.00003602575,0.000009178593,0.0009357136,0.000546771,0.0005394897,0.01493365,0.000107819,0.9690211],"study_design_scores_gemma":[0.002147927,0.0002213201,0.02954452,0.0004868927,0.00001378862,0.0001166421,0.00006234875,0.9226511,0.00001505138,0.000282907,0.04413425,0.0003232839],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1429865,0.04802781,0.7859454,0.02163104,0.0002633239,0.0007597167,0.000001535249,0.0001676333,0.0002170205],"genre_scores_gemma":[0.9426138,0.05018975,0.006220895,0.0008776489,0.0000530428,0.00001261667,0.00001089411,0.00001172578,0.000009591661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9686979,"threshold_uncertainty_score":0.8473524,"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."}}