{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002090572,0.001184862,0.001108259,0.001178358,0.0007354386,0.00148184,0.0007895837,0.001065875,0.002692216],"category_scores_gemma":[0.006543321,0.0007194267,0.001128959,0.002023723,0.001075632,0.002254776,0.002517769,0.00277705,0.0008502128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000515908,"about_ca_system_score_gemma":0.00114662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00187258,"about_ca_topic_score_gemma":0.002885354,"domain_scores_codex":[0.9983084,0.000716915,0.000083168,0.0001931797,0.0005244302,0.0001738411],"domain_scores_gemma":[0.9956486,0.002923318,0.0004210125,0.0005455934,0.0003135237,0.000147988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002047781,0.0002276639,0.002279471,0.0004870994,0.0001388912,0.0004550774,0.0003805018,0.5416893,0.02400829,0.07372218,0.007868857,0.3485379],"study_design_scores_gemma":[0.00002873566,0.00006542286,0.0002261004,0.00003607729,0.00002014688,0.0001622578,0.00005127656,0.9558872,0.004441075,0.03536994,0.003699744,0.00001204148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01439569,0.0003173875,0.9821937,0.0002201633,0.00001994561,0.00006733864,0.00005685367,0.0002972483,0.002431594],"genre_scores_gemma":[0.1420613,0.000367331,0.8554116,0.000167746,0.00003981342,0.0001543877,0.0002953291,0.0001517812,0.001350714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002692216,"threshold_uncertainty_score":0.01105613,"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."}}