{"id":"W2413417445","doi":"","title":"Optimal linear-time uplink scheduling algorithms for WiMAX","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Telecommunications link; WiMAX; Computer science; Scheduling (production processes); Network packet; Mathematical optimization; Wireless; Fair-share scheduling; Linear programming; Heuristic; Distributed computing; Algorithm; Computer network; Mathematics; Telecommunications; Quality of service; Artificial intelligence","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.000050263,0.0001513412,0.0001648346,0.00005138763,0.0001065024,0.00000915281,0.00009698724,0.00009200389,0.00009272077],"category_scores_gemma":[0.00001907945,0.0001590035,0.00005904494,0.0001634108,0.00002710634,0.0001994666,0.00001867402,0.000102242,0.00009984528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004473887,"about_ca_system_score_gemma":0.00001253974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.870644e-7,"about_ca_topic_score_gemma":2.027809e-7,"domain_scores_codex":[0.9992492,0.000003629602,0.0002009007,0.0001702104,0.00008421846,0.0002918138],"domain_scores_gemma":[0.9996256,0.00006197419,0.00002107507,0.0001568403,0.0000635665,0.00007091531],"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.000006118718,0.000008084529,0.00001772559,0.0000110811,0.00001622402,0.000002398821,0.00003779378,0.9948291,0.0006581566,0.00007251208,0.0005730758,0.003767728],"study_design_scores_gemma":[0.0003788848,0.0000232223,0.00001385529,0.00001002138,0.000006268221,0.00001309707,0.000006587454,0.9932226,0.004264113,0.00002517298,0.001833082,0.0002030872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01520185,0.0001829234,0.9818358,0.00003187951,0.0001906914,0.0002387109,0.000003980628,0.0008722258,0.001441937],"genre_scores_gemma":[0.04785634,0.0001489937,0.9501227,0.00003684964,0.0004070693,0.00004684101,0.00005765811,0.0000784937,0.001245013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03265449,"threshold_uncertainty_score":0.6483975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01729677776528334,"score_gpt":0.236073467357668,"score_spread":0.2187766895923847,"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."}}