Sciweavers

1016 search results - page 11 / 204
» Optimized algorithms for multi-agent routing
Sort
View
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
13 years 8 months ago
Neuro-evolution for a gathering and collective construction task
In this paper we apply three Neuro-Evolution (NE) methods as controller design approaches in a collective behavior task. These NE methods are Enforced Sub-Populations, MultiAgent ...
D. W. F. van Krevelen, Geoff S. Nitschke
ISPD
1999
ACM
89views Hardware» more  ISPD 1999»
13 years 12 months ago
VIA design rule consideration in multi-layer maze routing algorithms
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
Jason Cong, Jie Fang, Kei-Yong Khoo
CEC
2009
IEEE
13 years 10 months ago
A simple multi-objective optimization algorithm for the urban transit routing problem
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
Lang Fan, Christine L. Mumford, Dafydd Evans
ICCAD
2000
IEEE
91views Hardware» more  ICCAD 2000»
13 years 12 months ago
A Timing-Constrained Algorithm for Simultaneous Global Routing of Multiple Nets
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
CIKM
2007
Springer
13 years 11 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang