{"id":"W2108687116","doi":"10.1007/978-3-540-85958-1_32","title":"Exploiting Decomposition in Constraint Optimization Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Computer science; Bounding overwatch; Search tree; Recursion (computer science); Component (thermodynamics); Decomposition; Mathematical optimization; Tree (set theory); Decomposition method (queueing theory); Tree decomposition; Constraint (computer-aided design); Branch and bound; Depth-first search; Algorithm; Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence","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.0005415296,0.000412039,0.0003999274,0.001287365,0.0002367303,0.0003662109,0.001041687,0.0002919029,0.00004558537],"category_scores_gemma":[0.00006526951,0.0004412878,0.00008852251,0.0007474071,0.0005193086,0.0009970495,0.0003944342,0.0006409905,0.00001765374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005104296,"about_ca_system_score_gemma":0.0005343039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002160016,"about_ca_topic_score_gemma":0.0001130169,"domain_scores_codex":[0.9968939,0.00004605751,0.0006906996,0.001191956,0.0006789427,0.000498486],"domain_scores_gemma":[0.9984484,0.0002404325,0.0003358384,0.0006249963,0.0002215247,0.0001287973],"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.000001473152,0.00001428687,0.0000885317,0.00001240723,0.000002297751,0.00003819529,0.0005567754,0.72299,0.00002874805,0.002491466,0.000004106465,0.2737718],"study_design_scores_gemma":[0.0003631074,0.000063695,0.0001681534,0.0004506852,0.00000247716,0.0002221787,4.008406e-7,0.9882269,0.0001698727,0.009749549,0.00009221045,0.0004907574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005948361,0.0001315963,0.9924421,0.0005679586,0.0008313364,0.0005153656,0.000002821044,0.0001953046,0.005254068],"genre_scores_gemma":[0.1771506,0.0002775517,0.8216033,0.0006916975,0.0001499902,0.00001807086,0.00002244689,0.00003021046,0.00005613324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.273281,"threshold_uncertainty_score":0.9998039,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.017851611222919,"score_gpt":0.2407546221978134,"score_spread":0.2229030109748944,"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."}}