8695 search results - page 76 / 1739 » Making the Complex Simple |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system’s ...
AE
2003
Springer
14 years 1 months ago
2003
Springer
This paper addresses the problem of cooperative transport of an object by a group of two simple autonomous mobile robots called s-bots. S-bots are able to establish physical connec...
COMPGEOM
1996
ACM
14 years 9 days ago
1996
ACM
In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by perform...
CP
2006
Springer
13 years 12 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
TCS
2010
13 years 6 months ago
2010
Web services are distributed processes with a public description of their behavior, or contract. The availability of repositories of Web service descriptions enables interesting f...