{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005008205,0.0002950347,0.0003225302,0.0005505038,0.0004877126,0.0002111767,0.0006685426,0.0001601231,0.00004747352],"category_scores_gemma":[0.0001078545,0.0003301069,0.0001651133,0.0006310496,0.0002412377,0.0007969938,0.0003043233,0.0002640896,0.00002428919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004904872,"about_ca_system_score_gemma":0.0004302046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001054169,"about_ca_topic_score_gemma":0.000114991,"domain_scores_codex":[0.9976414,0.0000849874,0.0004532424,0.0006205541,0.0004151986,0.0007846312],"domain_scores_gemma":[0.998438,0.0001197609,0.0001112465,0.0006710581,0.0002015658,0.0004583689],"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.0001365243,0.0002282039,0.005368941,0.00007482895,0.0001160383,0.0002405363,0.00236691,0.2947671,0.05285782,0.08428056,0.003458422,0.5561041],"study_design_scores_gemma":[0.0006334036,0.0001110049,0.004086789,0.00003328616,0.000008311824,0.0007623249,0.00009372911,0.9656985,0.02707766,0.0004314754,0.0006433154,0.0004202183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02872455,0.00005877328,0.96677,0.00225735,0.0003925986,0.0009675202,0.00004287914,0.0006787105,0.0001076242],"genre_scores_gemma":[0.4310302,0.00002627426,0.5665656,0.001857961,0.0001122472,0.00007290734,0.000009763051,0.00003158684,0.0002934342],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6709313,"threshold_uncertainty_score":0.9999151,"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."}}