{"id":"W2166667495","doi":"10.1109/tc.2007.70808","title":"Sharp Thresholds for Scheduling Recurring Tasks with Distance Constraints","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dynamic priority scheduling; Scheduling (production processes); Fair-share scheduling; Rate-monotonic scheduling; Two-level scheduling; Job shop scheduling; Round-robin scheduling; Radar; Distributed computing; Fixed-priority pre-emptive scheduling; Mathematical optimization; Quality of service; Mathematics; Computer network","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.002321953,0.0006762696,0.001017284,0.001132315,0.0004786448,0.001666152,0.001095157,0.0008732029,0.002017682],"category_scores_gemma":[0.02204108,0.0006241249,0.0005454562,0.0008306741,0.001372818,0.002514351,0.001770751,0.00182132,0.0003305423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001495235,"about_ca_system_score_gemma":0.00125755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001435273,"about_ca_topic_score_gemma":0.0007990858,"domain_scores_codex":[0.9980856,0.0005076436,0.0001714638,0.0003216717,0.0005464712,0.0003672141],"domain_scores_gemma":[0.9850756,0.01050571,0.001946593,0.0008207095,0.0007853791,0.000866038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007875464,0.0002140817,0.002165543,0.0003935408,0.00008044833,0.0002566346,0.0005199723,0.7565449,0.04030008,0.1591589,0.001768374,0.03780998],"study_design_scores_gemma":[0.00007196453,0.0002844798,0.0008279589,0.00002955673,0.00001958944,0.00007660907,0.00009744251,0.8819905,0.006261651,0.1094684,0.0008302329,0.00004160299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2196175,0.0009949522,0.7737938,0.000379527,0.0000673289,0.00018298,0.0001737118,0.0007507412,0.00403946],"genre_scores_gemma":[0.9327634,0.0003212497,0.06524128,0.000150848,0.00003765984,0.0001777856,0.0001678702,0.0001188886,0.001020978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002321953,"threshold_uncertainty_score":0.01227981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02853944247007663,"score_gpt":0.2460327405393843,"score_spread":0.2174932980693077,"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."}}