{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003474621,0.001311221,0.001699301,0.002305,0.0009985204,0.001436593,0.002970496,0.0015674,0.00381895],"category_scores_gemma":[0.01868407,0.0008201973,0.001145183,0.004396885,0.001399544,0.002549321,0.002166416,0.002618535,0.0007213902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001649579,"about_ca_system_score_gemma":0.001910967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006093601,"about_ca_topic_score_gemma":0.008268833,"domain_scores_codex":[0.997286,0.001218575,0.0001581359,0.0003067266,0.0008357198,0.0001949123],"domain_scores_gemma":[0.9915657,0.0062403,0.0004179817,0.0008425887,0.0007523535,0.0001810473],"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.0002034687,0.0002715051,0.001225209,0.0002944155,0.0001090136,0.0001045567,0.0001309957,0.6606677,0.005072911,0.06168221,0.006023384,0.2642147],"study_design_scores_gemma":[0.00004477035,0.00003183066,0.0001048838,0.00001793522,0.00001558631,0.00002586993,0.00001021822,0.976989,0.001196572,0.02014733,0.001404317,0.0000117823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01787249,0.0004988302,0.9754249,0.0002764999,0.00007225344,0.0001574075,0.0000989757,0.001690134,0.003908536],"genre_scores_gemma":[0.1823663,0.0004137756,0.813695,0.0003750544,0.00007403358,0.0004551007,0.0004978397,0.0005200284,0.00160305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006093601,"threshold_uncertainty_score":0.01837575,"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."}}