1480 search results - page 37 / 296 » Ants can solve constraint satisfaction problems |
KBS
2007
13 years 10 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
IJCAI
1993
14 years 8 days ago
1993
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...
ASIAN
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
ECAI
2004
Springer
14 years 4 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
SODA
2001
ACM
14 years 10 days ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...