1480 search results - page 50 / 296 » Ants can solve constraint satisfaction problems |
AI
2005
Springer
14 years 9 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
105
click to vote
CONSTRAINTS
2008
14 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
78
Voted
SAC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
CIRA
2007
IEEE
15 years 4 months ago
2007
IEEE
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...