Sciweavers

830 search results - page 21 / 166
» Route kernels for trees
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 5 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 10 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
ICCAD
2007
IEEE
140views Hardware» more  ICCAD 2007»
15 years 8 months ago
Thermal-aware Steiner routing for 3D stacked ICs
— In this paper, we present the first work on the Steiner routing for 3D stacked ICs. In the 3D Steiner routing problem, the pins are located in multiple device layers, which ma...
Mohit Pathak, Sung Kyu Lim
ICCAD
1998
IEEE
81views Hardware» more  ICCAD 1998»
15 years 4 months ago
A simultaneous routing tree construction and fanout optimization algorithm
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
Amir H. Salek, Jinan Lou, Massoud Pedram
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 4 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan