{"id":"W2035307429","doi":"10.1109/twc.2014.012814.131045","title":"Routing, Scheduling and Power Allocation in Generic OFDMA Wireless Networks: Optimal Design and Efficiently Computable Bounds","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Geometric programming; Upper and lower bounds; Monomial; Wireless network; Job shop scheduling; Linear programming; Wireless; Integer programming; Routing (electronic design automation); Mathematics; Algorithm; Computer network; Discrete mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003844929,0.000305819,0.0003290504,0.0002744722,0.0005116102,0.0001292741,0.000376194,0.0001857699,0.000006882922],"category_scores_gemma":[0.000005305078,0.0003675158,0.0000423486,0.0007167587,0.0002144678,0.0003416732,0.00001447152,0.0005479362,0.000003840003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001384454,"about_ca_system_score_gemma":0.00002497109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002794199,"about_ca_topic_score_gemma":0.00006924073,"domain_scores_codex":[0.9983821,0.0002395515,0.0004745591,0.0003452814,0.0001580285,0.0004005149],"domain_scores_gemma":[0.998369,0.0005045926,0.00009627881,0.0008146003,0.00008755962,0.0001279618],"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.00001560774,0.0001124623,0.00008074217,0.00001863418,0.00003081081,2.859424e-7,0.0003869436,0.9638034,0.000916279,0.0005625129,0.000007918911,0.03406447],"study_design_scores_gemma":[0.0006287012,0.00005193664,0.0002333121,0.0001726771,0.00003353842,0.00000754443,0.0001102657,0.9973285,0.000965474,0.00002872393,0.0000887662,0.0003505328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1897243,0.0007050839,0.8085127,0.0001277698,0.0001783682,0.000367075,0.000004343196,0.0003130955,0.00006729806],"genre_scores_gemma":[0.926573,0.00394714,0.06908016,0.0000569355,0.00002324036,0.000199455,0.00001730248,0.00008381646,0.0000189297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7394325,"threshold_uncertainty_score":0.9998777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01474317280129721,"score_gpt":0.2296899002534231,"score_spread":0.2149467274521259,"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."}}