{"id":"W2293473511","doi":"","title":"Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Algorithm; Local search (optimization); Local consistency; Substructure; Computer science; Consistency (knowledge bases); Filter (signal processing); Search algorithm; Graph; Constraint satisfaction problem; Constraint (computer-aided design); Mathematics; Mathematical optimization; Theoretical computer science; Artificial intelligence; Engineering","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.002717152,0.0009476863,0.001539063,0.001628659,0.0009206995,0.001336426,0.001688712,0.001285215,0.005741897],"category_scores_gemma":[0.01023175,0.0006106284,0.00100321,0.001512353,0.0009895684,0.002624249,0.00116485,0.001907757,0.001249632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009056238,"about_ca_system_score_gemma":0.001298184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004802899,"about_ca_topic_score_gemma":0.006503829,"domain_scores_codex":[0.9985297,0.0005102337,0.00007448468,0.0002858684,0.0004357955,0.0001639058],"domain_scores_gemma":[0.9912443,0.007040345,0.0003719086,0.0007424114,0.000477505,0.0001236188],"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.0004299423,0.0003672357,0.00242672,0.0004339993,0.0001892996,0.0002169414,0.000303567,0.5236052,0.01212625,0.04290152,0.005460918,0.4115385],"study_design_scores_gemma":[0.0000532241,0.00008902062,0.0002031079,0.00001972006,0.00002657134,0.00006584627,0.00003085799,0.9814082,0.003272594,0.01337397,0.001443973,0.00001288651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0142675,0.0001757633,0.9827635,0.0001087828,0.00001708979,0.00005736214,0.00003090662,0.001161269,0.001417705],"genre_scores_gemma":[0.2094132,0.0001792691,0.7871801,0.0001914091,0.00005083376,0.0002148595,0.0003141407,0.0004432812,0.002012795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005741897,"threshold_uncertainty_score":0.01920855,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04992223949142664,"score_gpt":0.2836204925975456,"score_spread":0.2336982531061189,"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."}}