{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002594552,0.0003210286,0.0003472951,0.0002173941,0.0006369338,0.0001956581,0.0008402927,0.0001030517,0.000007811415],"category_scores_gemma":[0.000004187563,0.0003018891,0.0001746283,0.0004962663,0.000209973,0.0008078192,0.000005035727,0.000315949,0.00003475244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001352381,"about_ca_system_score_gemma":0.0001651866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002323939,"about_ca_topic_score_gemma":0.00001585666,"domain_scores_codex":[0.9977999,0.00005774755,0.0004106177,0.0007781467,0.0004121062,0.0005415039],"domain_scores_gemma":[0.9984344,0.0003078322,0.0001534432,0.0007420951,0.0001519547,0.0002102436],"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.0001405614,0.0003311173,0.0002111246,0.0001316209,0.0002720583,0.0001587107,0.002530175,0.8959425,0.001305519,0.004984792,0.0002902266,0.0937016],"study_design_scores_gemma":[0.002436888,0.0005440576,0.0001447418,0.0007006727,0.00003118398,0.0008945517,0.0001017255,0.9797473,0.01370434,0.0001642963,0.0006228492,0.0009074259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02160186,0.00003686034,0.9751402,0.0002809877,0.001456652,0.000603139,0.0000160674,0.0004701327,0.0003940659],"genre_scores_gemma":[0.6797943,0.000007992007,0.3198338,0.0001476692,0.00006825192,0.00007312007,0.000001309219,0.00002597386,0.00004766586],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6581924,"threshold_uncertainty_score":0.9999433,"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."}}