201 search results - page 3 / 41 » New Structural Decomposition Techniques for Constraint Satis... |
MFCS
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
CP
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
FLAIRS
2004
13 years 7 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...