Sciweavers

62 search results - page 1 / 13
» Bulk Cable Routing Using Genetic Algorithms
Sort
View
IEAAIE
1994
Springer
13 years 9 months ago
Bulk Cable Routing Using Genetic Algorithms
David A. Kloske, Robert E. Smith
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
13 years 10 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
SIGCOMM
2010
ACM
13 years 5 months ago
Greening backbone networks: reducing energy consumption by shutting off cables in bundled links
In backbone networks, the line cards that drive the links between neighboring routers consume a large amount of energy. Since these networks are typically overprovisioned, selecti...
Will Fisher, Martin Suchara, Jennifer Rexford
ISCA
2008
IEEE
119views Hardware» more  ISCA 2008»
13 years 4 months ago
Technology-Driven, Highly-Scalable Dragonfly Topology
Evolving technology and increasing pin-bandwidth motivate the use of high-radix routers to reduce the diameter, latency, and cost of interconnection networks. High-radix networks,...
John Kim, William J. Dally, Steve Scott, Dennis Ab...
CEC
2005
IEEE
13 years 10 months ago
FPGA segmented channel routing using genetic algorithms
A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (F...
Lipo Wang, Lei Zhou, Wen Liu