107 search results - page 18 / 22 » Searching for Maximum Cliques with Ant Colony Optimization |
LION
2009
Springer
14 years 3 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...
ANTSW
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. In this paper we present an estimation of distribution particle swarm optimization algorithm that borrows ideas from recent developments in ant colony optimization. In th...
GECCO
2007
Springer
14 years 14 days ago
2007
Springer
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
JUCS
2008
13 years 8 months ago
2008
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
GECCO
2006
Springer
14 years 7 days ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...