400 search results - page 41 / 80 » A Synthesis of Constraint Satisfaction and Constraint Solvin... |
EAAI
2008
13 years 7 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
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...
MATES
2009
Springer
14 years 2 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
HEURISTICS
2002
13 years 7 months ago
2002
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
CP
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...