{"id":"W1732358269","doi":"10.1007/978-3-540-74970-7_48","title":"On Universal Restart Strategies for Backtracking Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backtracking; Computer science; Constraint learning; Testbed; Look-ahead; Beam stack search; Focus (optics); Robustness (evolution); Satisfiability; Mathematical optimization; Constraint satisfaction problem; Search algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Beam search; Incremental heuristic search; Local consistency","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"],"consensus_categories":[],"category_scores_codex":[0.0008428462,0.0003267541,0.000269232,0.0009842194,0.0002890838,0.0006670975,0.001329567,0.0002500227,0.00004120925],"category_scores_gemma":[0.00004717333,0.0003226015,0.0001012446,0.0004329564,0.0004572246,0.0007058196,0.0002951713,0.0005679024,0.00002317628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003337608,"about_ca_system_score_gemma":0.0009039913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001334785,"about_ca_topic_score_gemma":0.0001665918,"domain_scores_codex":[0.9973788,0.00002002809,0.0003179392,0.001029979,0.0007319455,0.0005213046],"domain_scores_gemma":[0.9980021,0.0007791478,0.0001317778,0.00068341,0.0002963896,0.0001071994],"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.0000104499,0.000008564387,0.000006481234,0.00001506502,0.000004261536,0.00002341767,0.0003768131,0.1709256,0.00002266941,0.3629311,0.00001670991,0.4656589],"study_design_scores_gemma":[0.000370088,0.0002797564,0.00008920541,0.0002552896,0.000004291103,0.000028016,0.000001706318,0.7715255,0.0003641479,0.225379,0.001188956,0.0005140854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005773153,0.0000341262,0.9871069,0.0004942794,0.001178123,0.0004129156,0.000005285035,0.0001433051,0.0105673],"genre_scores_gemma":[0.1478491,0.00002743885,0.8495046,0.001635726,0.000385265,0.000004629453,0.00001211064,0.00003835633,0.0005427821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6005999,"threshold_uncertainty_score":0.9999226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03735381381327279,"score_gpt":0.2873480091355796,"score_spread":0.2499941953223068,"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."}}