Dynamic Management of Heuristics for Solving Structured CSPs

DOI10.1007/978-3-540-74970-7_27zbMath1145.68518OpenAlexW1582479872MaRDI QIDQ3523068

Philippe Jégou, Samba Ndojh Ndiaye, Cyril Terrioux

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_27

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Combining restarts, nogoods and bag-connected decompositions for solving csps ⋮ Dynamic Management of Heuristics for Solving Structured CSPs ⋮ On the notion of cycles in hypergraphs

Cites Work

• Hypertree decompositions and tractable queries
• Hybrid backtracking bounded by tree-decomposition of constraint networks
• Tree clustering for constraint networks
• A comparison of structural CSP decomposition methods
• Resolution versus search: Two strategies for SAT
• Bucket elimination: A unifying framework for reasoning
• On the Desirability of Acyclic Database Schemes
• Dynamic Management of Heuristics for Solving Structured CSPs
• Constraint solving via fractional edge covers
• Graph minors. II. Algorithmic aspects of tree-width
• Principles and Practice of Constraint Programming – CP 2003
• Recursive conditioning

This page was built for publication: Dynamic Management of Heuristics for Solving Structured CSPs