405 search results - page 33 / 81 » On the Complexity of Global Constraint Satisfaction |
CP
2008
Springer
15 years 26 days ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
125
click to vote
ICTAI
2009
IEEE
14 years 8 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
115
click to vote
CONSTRAINTS
2008
14 years 11 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
AAAI
2007
15 years 1 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...