808 search results - page 32 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
SAC
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
TIME
2002
IEEE
14 years 9 days ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
AIMSA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
CP
2011
Springer
12 years 7 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...