Sciweavers

2343 search results - page 124 / 469
» The Locomotive Routing Problem
Sort
View
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
14 years 3 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...
DBISP2P
2004
Springer
107views Database» more  DBISP2P 2004»
14 years 3 months ago
On Using Histograms as Routing Indexes in Peer-to-Peer Systems
Peer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solut...
Yannis Petrakis, Georgia Koloniari, Evaggelia Pito...
ISPAN
2002
IEEE
14 years 3 months ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen
INFOCOM
2000
IEEE
14 years 2 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
ISPD
1999
ACM
95views Hardware» more  ISPD 1999»
14 years 2 months ago
Incremental capacitance extraction and its application to iterative timing-driven detailed routing
In this paper, we consider delay optimization in multilayer detailed routing. Given a detailed routing by some detailed router, we iteratively improve the delays of critical nets ...
Yanhong Yuan, Prithviraj Banerjee