1197 search results - page 139 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
AI
2000
Springer
13 years 8 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
GECCO
2006
Springer
13 years 12 months ago
2006
Springer
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...