150 search results - page 2 / 30 » Solving Permutation Constraint Satisfaction Problems with Ar... |
FLAIRS
2006
13 years 7 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
CP
1995
Springer
13 years 9 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
AI
2008
Springer
13 years 6 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
CEC
2007
IEEE
14 years 17 days ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
FLAIRS
2008
13 years 8 months ago
2008
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...