{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00399801,0.0006505,0.0009420934,0.0005138306,0.0006864484,0.001245659,0.001938153,0.000759134,0.002661371],"category_scores_gemma":[0.01825267,0.0005276876,0.0006326866,0.00104485,0.001488133,0.002100688,0.001087332,0.001463587,0.0003630437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002253877,"about_ca_system_score_gemma":0.003800858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00294739,"about_ca_topic_score_gemma":0.003226121,"domain_scores_codex":[0.9968677,0.001297665,0.0001947083,0.000477009,0.0007162116,0.0004466836],"domain_scores_gemma":[0.9914723,0.005099679,0.0007924825,0.001421109,0.0006771373,0.0005373661],"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.0007493928,0.0003353677,0.001905365,0.0001600092,0.00005684789,0.00006327499,0.0002851517,0.8087904,0.003357713,0.1205819,0.001779876,0.06193465],"study_design_scores_gemma":[0.00005685467,0.00008613116,0.0002071538,0.000005717894,0.000009354991,0.00001489243,0.00002654875,0.9585398,0.001250666,0.03906351,0.0007331275,0.000006318215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2102007,0.0003215095,0.779496,0.0004499174,0.00005131587,0.0002381341,0.00009373551,0.0004831079,0.008665527],"genre_scores_gemma":[0.6809807,0.0002118158,0.3162749,0.00009556925,0.00003442301,0.0002909725,0.0002362872,0.0001400722,0.00173533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00399801,"threshold_uncertainty_score":0.02114373,"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."}}