{"id":"W2020291377","doi":"10.5555/545381.545437","title":"Broadcast scheduling: when fairness is fine","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Latency (audio); Online algorithm; Competitive analysis; Server; Computer network; Approximation algorithm; Distributed computing; Parallel computing; Operating system; Algorithm; Upper and lower bounds; Mathematical optimization","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":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001018138,0.0000729313,0.00007453594,0.00006544845,0.00008368323,0.0001994571,0.0005397048,0.00003416218,0.004647573],"category_scores_gemma":[0.00001907506,0.00006114411,0.00003234321,0.0002446608,0.00002162317,0.0004187646,0.0001685421,0.00007719283,0.001747289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000108777,"about_ca_system_score_gemma":0.00001051183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001328615,"about_ca_topic_score_gemma":0.000002237588,"domain_scores_codex":[0.9992003,0.00002319872,0.0001244921,0.0002336593,0.0002127862,0.0002055564],"domain_scores_gemma":[0.9994106,0.00002164683,0.00002286873,0.0003594317,0.00008222726,0.0001032593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002400065,0.0003781167,0.0009918743,0.0000335569,0.00003293062,0.00003165951,0.008155613,0.00652193,0.0003221838,0.3115831,0.1941606,0.477786],"study_design_scores_gemma":[0.000233712,0.00002900464,0.00002756296,0.000004985508,6.37336e-7,0.000008380065,0.00001166828,0.9431652,0.0004490878,0.001634973,0.05432577,0.0001090304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002200616,0.00008682119,0.8987347,0.01090471,0.00009933204,0.00007945401,6.538601e-7,0.0002189054,0.08965537],"genre_scores_gemma":[0.2356457,0.00006211888,0.6724674,0.004263203,0.00007312457,0.00001254695,0.000002240943,0.00001235052,0.08746132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9366432,"threshold_uncertainty_score":0.99903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05081797835851215,"score_gpt":0.2518005519291761,"score_spread":0.2009825735706639,"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."}}