{"id":"W112014004","doi":"","title":"Optimal scheduling of contract algorithms for anytime problems","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Acceleration; Computation; Algorithm; Scheduling (production processes); Mathematical optimization; Schedule; Matching (statistics); Approximation algorithm; Mathematics","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.0007602522,0.0001554722,0.0002011537,0.0002201306,0.0001529998,0.0002032204,0.0006449497,0.00009376388,0.0001173647],"category_scores_gemma":[0.0002726204,0.0001519511,0.00009052898,0.000416678,0.0001191445,0.0004022568,0.00005999851,0.0001502601,0.00005339747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005762712,"about_ca_system_score_gemma":0.0003732424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004634455,"about_ca_topic_score_gemma":0.00002014357,"domain_scores_codex":[0.9979568,0.0000541321,0.0005843118,0.0004116403,0.0006944349,0.0002986778],"domain_scores_gemma":[0.9975334,0.0003259288,0.0002156826,0.0001962078,0.001654409,0.00007436932],"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.0000158597,0.0001625128,0.000008198255,0.00001021778,0.000006365688,4.381483e-7,0.00007602879,0.2457654,0.003536176,0.7307557,0.00004321631,0.01961984],"study_design_scores_gemma":[0.00006127539,0.0001705136,0.00006959971,0.00003404821,0.000001960556,0.000001535602,0.00001798708,0.8380256,0.02722263,0.133985,0.0002610901,0.0001487985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001594672,0.0000245051,0.9902942,0.001565497,0.0001728007,0.0005000458,0.00003135376,0.00008605063,0.005730875],"genre_scores_gemma":[0.7954805,0.000008099284,0.2040283,0.0001190269,0.0000936854,0.00006213038,0.00002475058,0.00000815506,0.0001753124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7938859,"threshold_uncertainty_score":0.6196386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1439905611302124,"score_gpt":0.3591819608483168,"score_spread":0.2151913997181044,"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."}}