1480 search results - page 89 / 296 » Ants can solve constraint satisfaction problems |
CP
1998
Springer
15 years 2 months ago
1998
Springer
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
104
click to vote
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
AAAI
2008
15 years 2 days ago
2008
An ant deposits pheromone along the path that it travels and is more likely to choose a path with a higher concentration of pheromone. The sensing and dropping of pheromone makes ...
IJCAI
2007
14 years 11 months ago
2007
This paper investigates how to represent and solve multiagent task scheduling as a Distributed Constraint Optimization Problem (DCOP). Recently multiagent researchers have adopted...
CONSTRAINTS
1999
14 years 9 months ago
1999
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...