Sciweavers

CP
2005
Springer

Computing and Exploiting Tree-Decompositions for Solving Constraint Networks

13 years 9 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real practical interest yet. In this paper, we study several methods for computing a rough optimal tree-decomposition and assess their relevance for solving CSPs.
Philippe Jégou, Samba Ndiaye, Cyril Terriou
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where CP
Authors Philippe Jégou, Samba Ndiaye, Cyril Terrioux
Comments (0)