{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002761195,0.001796437,0.002350209,0.002074344,0.001546511,0.00299133,0.004662486,0.002028646,0.01176572],"category_scores_gemma":[0.01222472,0.001047697,0.001697669,0.0033861,0.002542478,0.00586043,0.004795422,0.003037513,0.002170952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001897827,"about_ca_system_score_gemma":0.001474293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004914314,"about_ca_topic_score_gemma":0.00623595,"domain_scores_codex":[0.9974661,0.0008005807,0.0002014815,0.0003982061,0.0006798997,0.000453792],"domain_scores_gemma":[0.9944617,0.003570818,0.0001947009,0.001196324,0.0004463418,0.0001301131],"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.0006443256,0.0001881908,0.0006036266,0.0005698004,0.000132731,0.0001819199,0.0006938899,0.1392739,0.004399198,0.4681666,0.01518366,0.3699622],"study_design_scores_gemma":[0.00008807928,0.00009050806,0.000247379,0.0001687043,0.0001125002,0.0001129259,0.0001194829,0.5140291,0.002871825,0.4742775,0.007833874,0.00004814674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01420873,0.002066938,0.9579214,0.0003217525,0.0001512859,0.000163963,0.0001962788,0.002085806,0.0228838],"genre_scores_gemma":[0.393172,0.00210178,0.5753248,0.0005899288,0.000200467,0.0006457449,0.0008563289,0.002405188,0.02470367],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01176572,"threshold_uncertainty_score":0.03936023,"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."}}