{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009089734,0.0001483667,0.0001410922,0.00007272272,0.00003034872,0.00001525599,0.0001017574,0.0001167909,0.00003997717],"category_scores_gemma":[0.000004130208,0.0001581677,0.00003381515,0.0002395028,0.00003120694,0.0002424819,0.00001706434,0.000111556,0.000005014325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008301422,"about_ca_system_score_gemma":0.000007178705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009086833,"about_ca_topic_score_gemma":0.00006836135,"domain_scores_codex":[0.9991568,0.00000874387,0.0002405935,0.0001771863,0.000067808,0.0003489099],"domain_scores_gemma":[0.9997061,0.00002744294,0.00002671182,0.0001398377,0.00004573737,0.00005411288],"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.00002137781,0.00002529492,0.0002500164,0.00001316533,0.000008661738,0.000001144053,0.0002129876,0.9058363,0.00002530416,0.001930592,0.0000795384,0.09159559],"study_design_scores_gemma":[0.0003468616,0.00003948075,0.0003602534,0.00002584046,0.000004615335,0.000001663289,0.0001868906,0.9978773,0.0006322108,0.00003545167,0.0002931976,0.0001962406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01248745,0.00007081077,0.9845945,0.000005727255,0.0002170831,0.0004601739,6.57844e-7,0.0003811276,0.001782468],"genre_scores_gemma":[0.859866,0.00002650234,0.1397364,0.00001624749,0.0000486631,0.0001720939,0.00002957538,0.00005225402,0.00005230638],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8473785,"threshold_uncertainty_score":0.6449891,"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."}}