Abstract
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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Jégou, P., Ndiaye, S. N., & Terrioux, C. (2005). Computing and exploiting tree-decompositions for solving constraint networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 777–781). Springer Verlag. https://doi.org/10.1007/11564751_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
