{"id":"W2060979176","doi":"10.1109/glocom.2011.6134078","title":"Fast Local D.C. Programming for Optimal Power Allocation in Wireless Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematical optimization; Maximization; Computer science; Computation; Constraint (computer-aided design); Computational complexity theory; Wireless network; Wireless; Global optimization; Exploit; Iterative method; Interference (communication); Optimization problem; Algorithm; Mathematics; Channel (broadcasting)","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.002320421,0.001913972,0.001254219,0.0009845195,0.0007336295,0.001096018,0.000909127,0.001523801,0.002280519],"category_scores_gemma":[0.005536464,0.0008891831,0.0009247931,0.001547633,0.00159079,0.0009815902,0.001822211,0.002641223,0.0008895646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001425538,"about_ca_system_score_gemma":0.001959827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004224336,"about_ca_topic_score_gemma":0.003276329,"domain_scores_codex":[0.9994141,0.000272321,0.00001839628,0.00006324612,0.0001757817,0.00005627469],"domain_scores_gemma":[0.9980314,0.001557849,0.0001114676,0.00006360107,0.0001907404,0.00004490669],"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.000036375,0.00003049264,0.0001398179,0.0001098127,0.00001268433,0.00003958343,0.00006104333,0.9310697,0.0009355086,0.03156099,0.001561231,0.03444277],"study_design_scores_gemma":[0.000007403623,0.00001068875,0.000014904,0.00000654334,0.000002018744,0.000008385588,0.000004845493,0.9936644,0.0002720941,0.005470451,0.0005345471,0.000003728642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002411447,0.0002675516,0.9949716,0.0001724819,0.00002492104,0.0000407461,0.00001758505,0.00009113825,0.002002535],"genre_scores_gemma":[0.2289439,0.00135869,0.7597649,0.0003919331,0.00009926243,0.001109397,0.0001558931,0.0002912388,0.007884857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004224336,"threshold_uncertainty_score":0.0122717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01065523972137955,"score_gpt":0.2096085132140267,"score_spread":0.1989532734926471,"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."}}