361 search results - page 36 / 73 » Ant Colony Optimization |
ADHOC
2010
13 years 6 months ago
2010
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating i...
LION
2009
Springer
14 years 4 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
JGO
2010
13 years 8 months ago
2010
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...