191 search results - page 14 / 39 » Reformulating Constraint Satisfaction Problems to Improve Sc... |
JETAI
2008
13 years 7 months 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...
FGR
2008
IEEE
14 years 2 months ago
2008
IEEE
Despite significant progress in deformable model fitting over the last decade, the problem of efficient and accurate person-independentface fitting remains a challenging probl...
SARA
2009
Springer
14 years 2 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
CPAIOR
2010
Springer
14 years 21 days ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...