1480 search results - page 8 / 296 » Ants can solve constraint satisfaction problems |
110
Voted
IJCAI
1993
15 years 1 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...
100
Voted
ECML
2005
Springer
15 years 5 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
15 years 3 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...
142
Voted
PROCEDIA
2011
14 years 2 months 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...
98
Voted
AIPS
2007
15 years 2 months 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...