{"id":"W2096740421","doi":"10.1109/bsc.2008.4563201","title":"Optimal linear-time algorithm for uplink scheduling of packets with hard deadlines in 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":"WiMAX; Telecommunications link; Computer science; Scheduling (production processes); Network packet; Wireless; Mathematical optimization; Distributed computing; Computer network; Mathematics; Telecommunications","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.00006183297,0.000158045,0.0002539308,0.00009627506,0.00003292138,0.000004304446,0.00008310115,0.00008239428,0.00002205471],"category_scores_gemma":[0.00001464309,0.0001450909,0.00003629079,0.000270969,0.00004121225,0.0001894644,0.00001407238,0.00009761067,0.000006768749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003480119,"about_ca_system_score_gemma":0.00002155786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002612811,"about_ca_topic_score_gemma":0.000003247878,"domain_scores_codex":[0.9992083,0.000005567828,0.0002749368,0.0001658689,0.00009760022,0.0002477102],"domain_scores_gemma":[0.9995987,0.00007082462,0.00004181577,0.0001440914,0.00009875363,0.00004576591],"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.00002021774,0.00001917241,0.0004284408,0.00002564082,0.00001712211,0.000004472579,0.00006035492,0.9899366,0.0005579368,0.00002150706,0.00004024994,0.008868313],"study_design_scores_gemma":[0.0007969874,0.00005998974,0.0002097337,0.00005411911,0.000006871666,0.00001179272,0.00001560464,0.98941,0.00917936,0.00001352214,0.00006106986,0.0001809211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1655501,0.0001267062,0.8336961,0.00001491813,0.00004261182,0.0002415324,0.000005356545,0.0001822907,0.000140336],"genre_scores_gemma":[0.1291751,0.0001095624,0.870317,0.00001042047,0.0001000696,0.00003505456,0.00003864974,0.00005652294,0.0001576191],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03662092,"threshold_uncertainty_score":0.5916634,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01188179703071227,"score_gpt":0.2158263685722403,"score_spread":0.2039445715415281,"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."}}