{"id":"W2138410336","doi":"10.1109/tcomm.2009.08.070350","title":"Optimality of threshold policies for transmission scheduling in correlated fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fading; Computer science; Network packet; Scheduling (production processes); Channel state information; Computer network; Transmission (telecommunications); Channel (broadcasting); Upper and lower bounds; Mathematical optimization; Dynamic priority scheduling; Wireless; Real-time computing; Mathematics; Telecommunications; Quality of service","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.0001245512,0.0001397368,0.0002017105,0.0002390042,0.000169366,0.00001309665,0.0003258634,0.0001146615,0.000007711034],"category_scores_gemma":[0.000003650437,0.0001629306,0.00008532351,0.0005464197,0.00005101191,0.0002029758,9.94447e-7,0.0002938379,0.000001521994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009085635,"about_ca_system_score_gemma":0.00001554734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007731162,"about_ca_topic_score_gemma":0.0000164816,"domain_scores_codex":[0.9991773,0.00002888478,0.0003906482,0.000119957,0.0000841681,0.0001990505],"domain_scores_gemma":[0.9990449,0.0001828463,0.00005008743,0.0006101049,0.00006482254,0.0000472696],"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.00002051797,0.000123052,0.00000399083,0.00001724409,0.00001350955,6.74362e-8,0.0005415949,0.9814939,0.00586767,0.0006004389,0.00000646068,0.01131155],"study_design_scores_gemma":[0.0004643603,0.00005174369,0.00006121842,0.0001671603,0.00001970118,0.000001127521,0.00007449496,0.9788001,0.01918874,0.0009389721,0.00008783821,0.0001446056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01642876,0.0003364682,0.9814417,0.0003870788,0.0001238466,0.0004168512,0.000020418,0.0002259011,0.0006190287],"genre_scores_gemma":[0.9438459,0.001173127,0.05479921,0.00002679445,0.000009495183,0.00007516582,0.00001940071,0.00002564461,0.00002522408],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9274172,"threshold_uncertainty_score":0.6644118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03317226548997994,"score_gpt":0.2901242632639434,"score_spread":0.2569519977739634,"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."}}