{"id":"W2465741342","doi":"10.4230/dagsemproc.10071.6","title":"Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Sublinear function; Competitive analysis; Omega; Fixed point; Scheduling (production processes); Mathematics; Upper and lower bounds; Computer science; Discrete mathematics; BETA (programming language); Combinatorics; Algorithm; 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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001023903,0.0004981778,0.0004905887,0.0003170342,0.0006945189,0.001616434,0.002155454,0.0003477482,0.0001553918],"category_scores_gemma":[0.0002152334,0.000441984,0.0003020033,0.0004926362,0.0003241076,0.002791184,0.0008234617,0.0009875797,0.0006042657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001225997,"about_ca_system_score_gemma":0.0005815603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001377174,"about_ca_topic_score_gemma":0.00005565891,"domain_scores_codex":[0.9961548,0.00003297509,0.001194576,0.0004657435,0.0009868912,0.001165024],"domain_scores_gemma":[0.9968508,0.0001619864,0.0003952273,0.001416253,0.0006781316,0.0004976132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001217976,0.006650876,0.03087405,0.004505228,0.001532091,0.0003127193,0.08574109,0.01448552,0.006981354,0.6238647,0.09153006,0.1323044],"study_design_scores_gemma":[0.003314418,0.0003754873,0.0006156655,0.0000937712,0.00002578983,0.0001701793,0.0001830477,0.8878832,0.001163086,0.001369516,0.1039458,0.0008599542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1312108,0.00003684613,0.8400231,0.00197802,0.003532454,0.002360014,0.000261195,0.0008497282,0.01974783],"genre_scores_gemma":[0.7893661,0.00002038931,0.2069403,0.002148663,0.0002205614,0.0001970052,0.0001461552,0.00005950425,0.0009013744],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8733977,"threshold_uncertainty_score":0.9998032,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02426286062609075,"score_gpt":0.2645023520200533,"score_spread":0.2402394913939625,"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."}}