{"id":"W2082779900","doi":"10.1007/s10601-012-9119-x","title":"Improved filtering for weighted circuit constraints","year":2012,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Relaxation (psychology); Constraint satisfaction problem; Computer science; Travelling salesman problem; Search tree; Linear programming relaxation; Bounding overwatch; Domain (mathematical analysis); Context (archaeology); Mathematical optimization; Solver; Tree (set theory); Constraint (computer-aided design); Constraint satisfaction; Algorithm; Constraint logic programming; Routing (electronic design automation); Lagrangian relaxation; Integer programming; Mathematics; Probabilistic logic; Search algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001570898,0.001606526,0.001861391,0.00193459,0.0007111144,0.002106848,0.001980869,0.001478569,0.01108877],"category_scores_gemma":[0.006990215,0.0009042085,0.001558447,0.002774412,0.0005760251,0.003037594,0.001223164,0.002080337,0.001450775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001192046,"about_ca_system_score_gemma":0.001258346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01051463,"about_ca_topic_score_gemma":0.01402047,"domain_scores_codex":[0.9982433,0.0003625315,0.0001046954,0.0003346562,0.0007842915,0.0001703904],"domain_scores_gemma":[0.996935,0.001737925,0.0001548863,0.0004669855,0.0006406085,0.00006471064],"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.000293977,0.0001605329,0.0006131402,0.0004599822,0.0001727783,0.0002494917,0.0001152189,0.4493287,0.01789666,0.109303,0.01355567,0.4078509],"study_design_scores_gemma":[0.00001598269,0.00002471212,0.000128475,0.00002038329,0.00002706674,0.00004894768,0.00001111579,0.9687421,0.002772518,0.02468115,0.003512344,0.00001522246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003549403,0.0002053257,0.9940462,0.00006593329,0.00006521781,0.00002598798,0.000120731,0.0002237954,0.001697371],"genre_scores_gemma":[0.1708998,0.0008513922,0.8124434,0.0002920566,0.0002257874,0.0001804496,0.001681609,0.000510406,0.01291516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01108877,"threshold_uncertainty_score":0.03709561,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02837333951332646,"score_gpt":0.2540666528241169,"score_spread":0.2256933133107905,"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."}}