Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

CP
2005
Springer

favoriteEmaildiscussreport

82views Artificial Intelligence» more CP 2005»

Computing and Exploiting Tree-Decompositions for Solving Constraint Networks

14 years 4 months ago

Computing and Exploiting Tree-Decompositions for Solving Constraint Networks

Download liris.cnrs.fr

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

Real-time Traffic

CP 2005 | Methods Exploiting Tree-decompositions | Programming Languages | Rough Optimal Tree-decomposition | Theoretical Time Complexity |

claim paper

Related Content

» An Extension of Complexity Bounds and Dynamic Heuristics for TreeDecompositions of CSP

» Tree Decomposition with Applications to Constraint Processing

» Ant Colony Optimization for Tree Decompositions

» STCSP Structured Temporal Constraint satisfaction Problems

» A Generalized CyclicClustering Approach for Solving Structured CSPs

» Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure

» Constraint Answer Set Solving

» Exploiting Decomposition in Constraint Optimization Problems

» FloPSy SearchBased Floating Point Constraint Solving for Symbolic Execution

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CP
Authors	Philippe Jégou, Samba Ndiaye, Cyril Terrioux

Comments (0)