830 search results - page 68 / 166 » Route kernels for trees |
137
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
141
click to vote
JCIT
2008
15 years 4 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
117
click to vote
TSMC
1998
15 years 3 months ago
1998
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
137
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
115
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...