CSUR
2000
13 years 12 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
AI
2005
Springer
14 years 12 hour ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
AI
2005
Springer
14 years 12 hour ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
SAC
2006
ACM
14 years 14 hour ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
JAIR
2006
14 years 2 days ago
2006
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
JETAI
2008
14 years 2 days ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
CORR
2007
Springer
14 years 2 days ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
APIN
2006
14 years 5 days ago
2006
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
CSR
2008
Springer
14 years 5 days ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
CORR
2010
Springer
14 years 6 days ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...