{"id":"W2015594166","doi":"10.1109/isspit.2006.270891","title":"Optimum Throughput Constrained Opportunistic Scheduling in Cellular Data Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Exploit; Fading; Telecommunications link; Fair-share scheduling; Round-robin scheduling; Computer network; Dynamic priority scheduling; Distributed computing; Channel (broadcasting); Quality of service; Mathematical optimization; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001467159,0.000179041,0.0001953365,0.00006743069,0.0000383876,0.00003722543,0.0002827749,0.0001108215,0.0001103888],"category_scores_gemma":[0.00001349145,0.0001977375,0.00001829814,0.0003052381,0.00004839865,0.0003293588,0.00008754803,0.0001956039,0.00001217925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005707018,"about_ca_system_score_gemma":0.00001826276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002106241,"about_ca_topic_score_gemma":0.00006482727,"domain_scores_codex":[0.9988874,0.00001695847,0.0003502909,0.0002797951,0.0001051632,0.000360407],"domain_scores_gemma":[0.9992876,0.00006859585,0.00003354318,0.0005389082,0.00002055757,0.00005078248],"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.000002215105,0.00001399084,0.0002826699,0.00001243053,0.000006392124,0.00003018755,0.000004281721,0.9933192,0.0002710061,0.00396376,0.0004869722,0.001606907],"study_design_scores_gemma":[0.0003360967,0.000004625595,0.00006072607,0.00003264207,0.000007837089,0.000003681563,0.00002339392,0.998386,0.00007486237,0.0003287373,0.0005156074,0.0002258054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003420925,0.0004201915,0.981691,0.00002984521,0.0002613522,0.0001687639,0.00001131943,0.0004791685,0.01351742],"genre_scores_gemma":[0.8552443,0.000141292,0.1432772,0.00002726972,0.0002360133,0.000007157791,0.0008952693,0.00005006135,0.0001214238],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8518233,"threshold_uncertainty_score":0.8063501,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02037556615116609,"score_gpt":0.2256037279891536,"score_spread":0.2052281618379875,"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."}}