1480 search results - page 8 / 296 » Ants can solve constraint satisfaction problems |
IJCAI
1993
13 years 11 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
ECML
2005
Springer
14 years 3 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
SPDP
1991
IEEE
14 years 1 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
PROCEDIA
2011
13 years 19 days ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
AIPS
2007
14 years 4 days ago
2007
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at...