{"id":"W1617540954","doi":"10.1007/978-3-540-68155-7_26","title":"Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Key (lock); Constraint (computer-aided design); Computer science; Constraint programming; Inference; Algorithm; Constraint satisfaction problem; Satisfiability; Backtracking; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Stochastic programming","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.0006039136,0.0004761595,0.0004941333,0.001027155,0.0004184923,0.0004830055,0.001642706,0.0002348841,0.00004756832],"category_scores_gemma":[0.00007175838,0.0004952778,0.0001565961,0.0005386529,0.00101541,0.0007069209,0.0008223019,0.0005207488,0.00003332464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005047068,"about_ca_system_score_gemma":0.0008655424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002172574,"about_ca_topic_score_gemma":0.00001596727,"domain_scores_codex":[0.9963169,0.00002969315,0.0005324734,0.001473673,0.0008780473,0.0007692712],"domain_scores_gemma":[0.9980421,0.0003347819,0.0001586189,0.0008074532,0.0003419372,0.0003151055],"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.000005486594,0.000007198566,0.000007638869,0.00001846321,0.000007875482,0.00003655926,0.0004958521,0.3186136,0.0003020473,0.002507781,0.00002651045,0.6779709],"study_design_scores_gemma":[0.0003887881,0.0001204299,0.00004925591,0.0002084025,0.000005174139,0.0003861274,5.917603e-7,0.9911774,0.002831744,0.003491165,0.000731375,0.0006095215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009112525,0.00005957963,0.9951699,0.0006072901,0.002756267,0.0007817541,0.00002243529,0.0001613846,0.0003502887],"genre_scores_gemma":[0.0419479,0.00003029829,0.9552568,0.001952929,0.0005049031,0.00000647754,0.000008465796,0.00004062384,0.0002516548],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6773614,"threshold_uncertainty_score":0.9997499,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07045167649631688,"score_gpt":0.3040640182788782,"score_spread":0.2336123417825614,"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."}}