224 search results - page 43 / 45 » Quick-and-dirty ant colony optimization |
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
DICS
2006
13 years 11 months ago
2006
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
HEURISTICS
2006
13 years 7 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, a novel variant of particle swarm optimization (PSO), named memetic particle swarm optimization algorithm (MeSwarm), is proposed for tackling the overshooting probl...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...