Sciweavers

2343 search results - page 92 / 469
» The Locomotive Routing Problem
Sort
View
ASPDAC
2006
ACM
120views Hardware» more  ASPDAC 2006»
14 years 4 months ago
A novel framework for multilevel full-chip gridless routing
— Due to its great flexibility, gridless routing is desirable for nanometer circuit designs that use variable wire widths and spacings. Nevertheless, it is much more difficult ...
Tai-Chen Chen, Yao-Wen Chang, Shyh-Chang Lin
IPCCC
2007
IEEE
14 years 4 months ago
Rerouting Time and Queueing in Proactive Ad Hoc Networks
In a MANET network where nodes move frequently, the probability of connectivity loss between nodes might be high, and communication sessions may easily loose connectivity during t...
Vinh Pham, Erlend Larsen, Knut Øvsthus, Paa...
GD
1997
Springer
14 years 2 months ago
Implementing a General-Purpose Edge Router
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
David P. Dobkin, Emden R. Gansner, Eleftherios Kou...
ASPDAC
2007
ACM
74views Hardware» more  ASPDAC 2007»
14 years 2 months ago
A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks
How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL is no longer v...
Tan Yan, Shuting Li, Yasuhiro Takashima, H. Murata
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
14 years 7 months ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong