1480 search results - page 14 / 296 » Ants can solve constraint satisfaction problems |
AMAI
1999
Springer
13 years 9 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
ACST
2006
13 years 11 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
IDEAL
2003
Springer
14 years 3 months ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
FLAIRS
2003
13 years 11 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
IDA
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...