1480 search results - page 9 / 296 » Ants can solve constraint satisfaction problems |
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
CP
1997
Springer
14 years 2 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
JACM
2010
13 years 8 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
AISC
2004
Springer
14 years 3 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
PACT
1999
Springer
14 years 2 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...