625 search results - page 16 / 125 » Routing in Trees |
HM
2007
Springer
15 years 4 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
VLSID
2005
IEEE
15 years 10 months ago
2005
IEEE
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we present several novel techniques that make the recently published multilevel routing scheme [19] more effective and complete. Our contributions include: (1) reso...
NGC
2002
Springer
14 years 9 months ago
2002
Springer
Efficient handling of mobile nodes in a multicast environment is a non-trivial task. Solutions based on bi-directional tunneling introduce encapsulation and triangular routing. Th...
ASPDAC
2009
ACM
15 years 1 months ago
2009
ACM
The number of vias generated during the global routing stage is a critical factor for the yield of final circuits. However, most global routers only approach the problem by chargin...