{"id":"W49964765","doi":"","title":"Exploiting decomposition on constraint problems with high tree-width","year":2009,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Decomposition; Tree decomposition; Tree (set theory); Search tree; Decomposition method (queueing theory); Heuristic; Constraint (computer-aided design); Computer science; Treewidth; Mathematical optimization; Algorithm; Branch and bound; Mathematics; Theoretical computer science; Search algorithm; Discrete mathematics; Combinatorics; Graph; Pathwidth","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":[],"consensus_categories":[],"category_scores_codex":[0.0000906705,0.0001109862,0.00009349566,0.00009961188,0.0001164144,0.000152854,0.0001438261,0.00003332409,0.00009016191],"category_scores_gemma":[0.000006183481,0.00008714779,0.00002524146,0.0002168762,0.00002851472,0.0003895102,0.0000123699,0.00008317782,0.00003692335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004245462,"about_ca_system_score_gemma":0.00003644635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001028908,"about_ca_topic_score_gemma":0.00002378723,"domain_scores_codex":[0.9991879,0.00002820121,0.0001575119,0.0002670613,0.0001904249,0.0001689123],"domain_scores_gemma":[0.9995589,0.0000379632,0.00006773713,0.0002029257,0.000058274,0.00007424249],"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.00001034114,0.0000798687,0.0003228526,0.000002706353,0.000007760118,0.0000100471,0.0002143992,0.01012291,0.00117843,0.3848405,0.000148115,0.603062],"study_design_scores_gemma":[0.007806856,0.006199052,0.1816276,0.0006714396,0.00004377046,0.0007434397,0.0005288917,0.6941841,0.04979488,0.05432099,0.001582877,0.002496113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0157934,0.000002215558,0.9435037,0.003578322,0.00007040126,0.0001745469,5.774114e-7,0.0003744523,0.03650237],"genre_scores_gemma":[0.843763,0.000003102213,0.154904,0.001197254,0.00002178813,0.000005276129,0.000005313049,0.000003255637,0.00009700962],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8279696,"threshold_uncertainty_score":0.3553784,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01143007783876871,"score_gpt":0.2281986922501228,"score_spread":0.2167686144113541,"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."}}