{"id":"W2898525980","doi":"10.1007/s10951-020-00644-9","title":"Interruptible algorithms for multiproblem solving","year":2020,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Schedule; Multiprocessing; Scheduling (production processes); Upper and lower bounds; Computation; Class (philosophy); Job shop scheduling; Multiprocessor scheduling; Mathematical optimization; Quality (philosophy); Algorithm; Parallel computing; Mathematics; Artificial intelligence","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.0004663342,0.00009353954,0.000242849,0.00005074231,0.00007792489,0.0001975672,0.0006729005,0.00004325087,0.00000259105],"category_scores_gemma":[0.0001712826,0.00007830585,0.000158845,0.0002062104,0.0000110697,0.0006882395,0.00008003521,0.000192125,0.000008279857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002711999,"about_ca_system_score_gemma":0.00007551057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001997046,"about_ca_topic_score_gemma":2.678464e-7,"domain_scores_codex":[0.9989102,0.00001916129,0.0005050221,0.0001499347,0.0002170192,0.0001986891],"domain_scores_gemma":[0.9989567,0.00006998849,0.0003931536,0.0001110781,0.0003001375,0.0001688973],"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.0003309016,0.0005048689,0.003094672,0.001141817,0.0007089193,0.0004477136,0.02243609,0.1596779,0.1864309,0.05135383,0.01053885,0.5633335],"study_design_scores_gemma":[0.001077013,0.0003049253,0.00007365213,0.0002369875,0.00001016272,0.00009253677,0.0003036528,0.9801061,0.003800795,0.0004310325,0.01340742,0.0001557724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009659381,0.0005762191,0.9857399,0.00323468,0.000562726,0.00008708907,0.000003180973,0.00002898091,0.0001077828],"genre_scores_gemma":[0.5670658,0.000008113642,0.4321562,0.0003541517,0.0003972292,0.000001495107,3.244712e-7,0.000005796476,0.00001089704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8204282,"threshold_uncertainty_score":0.319322,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06143264323058698,"score_gpt":0.2962638072315829,"score_spread":0.2348311640009959,"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."}}