Sciweavers

224 search results - page 41 / 45
» Quick-and-dirty ant colony optimization
Sort
View
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
14 years 1 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
ATAL
2004
Springer
14 years 1 months ago
A Pheromone-Based Utility Model for Collaborative Foraging
Multi-agent research often borrows from biology, where remarkable examples of collective intelligence may be found. One interesting example is ant colonies’ use of pheromones as...
Liviu Panait, Sean Luke
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
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...
Martin Gruber, Jano I. van Hemert, Günther R....
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
13 years 11 months ago
The Brueckner network: an immobile sorting swarm
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...
William A. Tozier, Michael R. Chesher, Tejinderpal...
SWARM
2008
SPRINGER
222views Optimization» more  SWARM 2008»
13 years 7 months ago
Biologically inspired redistribution of a swarm of robots among multiple sites
We present a biologically inspired approach to the dynamic assignment and reassignment of a homogeneous swarm of robots to multiple locations, which is relevant to applications lik...
M. Ani Hsieh, Ádám M. Halász,...