{"id":"W1599436623","doi":"10.1007/978-3-540-24840-8_58","title":"Constraint Directed Dynamic Backtracking","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Backtracking; Thrashing; Computer science; Constraint learning; Look-ahead; Constraint satisfaction problem; Mathematical optimization; Constraint satisfaction; Constraint (computer-aided design); Algorithm; Theoretical computer science; Mathematics; Constraint logic programming; Parallel computing; Artificial intelligence","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.000756687,0.001112315,0.00075394,0.001395134,0.001283194,0.002005385,0.002645194,0.001285995,0.02927371],"category_scores_gemma":[0.00305539,0.0008727866,0.000929071,0.00246544,0.0013378,0.002125016,0.002701849,0.002066407,0.006394935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001356007,"about_ca_system_score_gemma":0.001752008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005718007,"about_ca_topic_score_gemma":0.01013216,"domain_scores_codex":[0.9988695,0.0002150743,0.00005651286,0.0002263265,0.0004977728,0.0001348247],"domain_scores_gemma":[0.9986246,0.0005693191,0.00005869333,0.0003513112,0.0003447007,0.00005138576],"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.0002365146,0.0001986444,0.0003423106,0.0007558856,0.00006861697,0.0003887916,0.0003819282,0.04939333,0.0106893,0.3485987,0.06932122,0.5196248],"study_design_scores_gemma":[0.00009233467,0.00005513324,0.0002442649,0.0002853861,0.00009714047,0.0004549286,0.0001493693,0.2497372,0.02696123,0.5051072,0.2167543,0.00006148932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004968098,0.0008277965,0.8561333,0.0005149998,0.000304589,0.0002350453,0.0008376038,0.002953694,0.1332249],"genre_scores_gemma":[0.1418003,0.001787784,0.7230976,0.0006760103,0.0001123789,0.0004062043,0.003321848,0.002036023,0.1267619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02927371,"threshold_uncertainty_score":0.09793037,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01088026213736945,"score_gpt":0.2357980504438831,"score_spread":0.2249177883065136,"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."}}