{"id":"W2128419582","doi":"10.1613/jair.4360","title":"Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Dynamic programming; Schedule; Mathematical optimization; Computation; Acceleration; Scheduling (production processes); Conjecture; Matching (statistics); Algorithm; Class (philosophy); Job shop scheduling; Mathematics; Discrete 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.01118334,0.0001172106,0.0003357781,0.0006172771,0.0002460771,0.0003285653,0.001346564,0.00009548799,0.00005160021],"category_scores_gemma":[0.002118399,0.00009762182,0.0001769803,0.0008402817,0.0002143744,0.0007761155,0.0001943845,0.0005977102,0.00001985177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006991158,"about_ca_system_score_gemma":0.0004426296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000212857,"about_ca_topic_score_gemma":0.000004366805,"domain_scores_codex":[0.9965827,0.0003914087,0.001045008,0.0002484485,0.001142274,0.0005901222],"domain_scores_gemma":[0.9942555,0.001494563,0.0004001661,0.000308463,0.003291936,0.0002493649],"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.0001787214,0.0004600145,0.00008029569,0.0001176621,0.00006964593,0.00001092174,0.002680016,0.2530791,0.0306296,0.1722924,0.0001968033,0.5402048],"study_design_scores_gemma":[0.00008729207,0.001091472,0.0000182757,0.0001297537,0.000003783386,0.00002066281,0.0002917596,0.9135448,0.06025065,0.02386981,0.0005899808,0.0001017796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008919497,0.0001303549,0.9884474,0.001443084,0.0002056304,0.0003531618,0.000001562586,0.00001562161,0.0004837179],"genre_scores_gemma":[0.4774956,0.00007257335,0.5221122,0.00002254226,0.0002323745,0.000005943014,4.259703e-7,0.00001062853,0.00004774281],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6604657,"threshold_uncertainty_score":0.3980902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1673227421662571,"score_gpt":0.4248170278948427,"score_spread":0.2574942857285856,"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."}}