{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008480468,0.0004733268,0.0005813872,0.0004566762,0.0004098038,0.0008231958,0.0004449871,0.0004434716,0.0004357718],"category_scores_gemma":[0.00287724,0.0003328082,0.0001981891,0.001044814,0.0006398789,0.0007490405,0.0005022302,0.0003134072,0.00007917948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009031571,"about_ca_system_score_gemma":0.0009576128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003005493,"about_ca_topic_score_gemma":0.002538281,"domain_scores_codex":[0.9992809,0.0002817656,0.00002449013,0.00006923849,0.000195364,0.0001482757],"domain_scores_gemma":[0.9990012,0.0006479833,0.0001367889,0.00005673817,0.0001137484,0.00004346319],"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.00006198035,0.00001375584,0.0003908383,0.00003850672,0.00001600112,0.00006162118,0.00003002404,0.9664744,0.001380971,0.01574959,0.0004696328,0.01531278],"study_design_scores_gemma":[0.000007280888,0.00001483076,0.00009680393,0.000002991252,0.000004089205,0.00001857111,0.00001005732,0.9924865,0.0004041919,0.006485884,0.000465768,0.00000303688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07163879,0.001382846,0.9219447,0.0002095703,0.00006131941,0.00004445025,0.00009214874,0.0001373065,0.004488941],"genre_scores_gemma":[0.9517633,0.0008059199,0.04612689,0.00003763375,0.00004580903,0.00005601485,0.00004658583,0.00002724835,0.001090439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003005493,"threshold_uncertainty_score":0.006552935,"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."}}