421 search results - page 39 / 85 » Ant algorithms |
111
Voted
ANTSW
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
82
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Generally, swarm models and algorithms consider synchronous agents, i.e., they act simultaneously. This hypothesis does not fit multi-agent simulators nor robotic systems. In this...
110
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
143
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
ANTS
2004
Springer
15 years 8 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...