{"id":"W2163521536","doi":"10.1109/icc.2007.84","title":"Optimal Scheduling Policy Determination for High Speed Downlink Packet Access","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Granularity; Telecommunications link; Scheduling (production processes); Network packet; Dynamic priority scheduling; Computational complexity theory; Dynamic programming; Mathematical optimization; Heuristic; Bellman equation; Distributed computing; Computer network; Quality of service; Algorithm; 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.001330671,0.0004877109,0.0009802062,0.0005387379,0.0004402952,0.001010044,0.0005748615,0.0006538252,0.001218093],"category_scores_gemma":[0.004395676,0.0005057756,0.0004379788,0.0004288743,0.0008902415,0.0009264352,0.0005118237,0.0008955568,0.0001944652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001720519,"about_ca_system_score_gemma":0.002909968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004027952,"about_ca_topic_score_gemma":0.002122317,"domain_scores_codex":[0.9989907,0.0003813181,0.00002722351,0.0001205546,0.000302119,0.0001780452],"domain_scores_gemma":[0.9983582,0.001067909,0.0002420395,0.00006091327,0.0002094606,0.00006145997],"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.00002676661,0.00002428198,0.0002508114,0.00002678193,0.000011386,0.00002341136,0.0000224724,0.981719,0.001043408,0.01076011,0.0002136013,0.00587797],"study_design_scores_gemma":[0.000003139893,0.00001199475,0.00004823119,0.00000252272,0.000002011134,0.000006421817,0.000006588252,0.9967572,0.0003317388,0.002709574,0.0001185364,0.000002167709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02839179,0.0001453831,0.9696473,0.000107711,0.0000177004,0.00003203029,0.00002012106,0.00007329191,0.001564612],"genre_scores_gemma":[0.8694731,0.0002600107,0.1287523,0.00004799231,0.00002269242,0.0000739096,0.00005019838,0.00004020868,0.00127955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004027952,"threshold_uncertainty_score":0.0124833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01505489671929666,"score_gpt":0.2977755658789145,"score_spread":0.2827206691596179,"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."}}