1480 search results - page 49 / 296 » Ants can solve constraint satisfaction problems |
ICMAS
1998
14 years 11 months ago
1998
This paper describes how multiple interacting swarms of adaptive mobile agents can be used to solve problems in networks. The paper introduces a new architectural description for ...
NSDI
2007
14 years 12 months ago
2007
Determining the physical location of Internet hosts is a critical enabler for many new location-aware services. In this paper, we present Octant, a novel, comprehensive framework ...
AI
2006
Springer
14 years 9 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
91
Voted
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
AIMSA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....