1480 search results - page 101 / 296 » Ants can solve constraint satisfaction problems |
SAC
2003
ACM
15 years 3 months ago
2003
ACM
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
IJCAI
2003
14 years 11 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
AAAI
2006
14 years 11 months ago
2006
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We explore the problem of reconstructing an image from a bag of square, non-overlapping image patches, the jigsaw puzzle problem. Completing jigsaw puzzles is challenging and requ...