{"id":"W2566425679","doi":"10.1609/aaai.v30i1.10433","title":"Counting-Based Search for Constraint Optimization Problems","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Benchmark (surveying); Constraint satisfaction problem; Mathematical optimization; Constraint (computer-aided design); Computation; Computer science; Constraint satisfaction; Constraint programming; Optimization problem; Counting problem; Constraint satisfaction dual problem; Adaptation (eye); Local search (optimization); Metaheuristic; Mathematics; Constraint logic programming; Algorithm; Artificial intelligence; Stochastic programming","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0005703148,0.0001653831,0.0001698618,0.0001389913,0.0002015669,0.0002070154,0.0008928007,0.00008162283,0.0001316958],"category_scores_gemma":[0.0003146319,0.0001057293,0.000103192,0.0004245727,0.0003241794,0.0004037812,0.00009982425,0.0001004913,0.00002181599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006322344,"about_ca_system_score_gemma":0.0002074357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007839892,"about_ca_topic_score_gemma":0.000004548899,"domain_scores_codex":[0.9984497,0.00001515927,0.0004518228,0.0004125196,0.0003831659,0.0002876032],"domain_scores_gemma":[0.9980546,0.0001917353,0.0002828609,0.0002119412,0.001187811,0.00007109886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003402828,0.00006672291,0.0003451669,0.0000372172,0.000008328897,5.236103e-8,0.0002034986,0.01536414,0.01779505,0.8062575,0.00005292792,0.1598354],"study_design_scores_gemma":[0.00008003117,0.000139539,0.00004967855,0.0002306029,0.000006009735,0.000001852627,0.00008490822,0.6340711,0.3420971,0.02299554,0.0000809323,0.0001627695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002767079,0.000003038951,0.9829641,0.01080894,0.0002661455,0.0006789451,0.0000110337,0.0001072251,0.002393488],"genre_scores_gemma":[0.9546933,0.00001477833,0.04487992,0.0002017268,0.00003451395,0.00005541418,7.389007e-7,0.00001049986,0.0001090797],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9519262,"threshold_uncertainty_score":0.4311517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07479258741980677,"score_gpt":0.2882084655670942,"score_spread":0.2134158781472874,"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."}}