830 search results - page 33 / 166 » Route kernels for trees |
130
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
158
Voted
SENSYS
2006
ACM
15 years 9 months ago
2006
ACM
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
124
click to vote
HM
2007
Springer
15 years 10 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 ...
128
Voted
TCAD
2002
15 years 3 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
95
Voted
ICCAD
2002
IEEE
16 years 20 days 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...