1480 search results - page 29 / 296 » Ants can solve constraint satisfaction problems |
CP
2001
Springer
14 years 3 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
GECCO
2003
Springer
14 years 4 months ago
2003
Springer
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
CP
2004
Springer
14 years 4 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
CSR
2009
Springer
14 years 1 days ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
DAGSTUHL
2008
14 years 12 days ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...