625 search results - page 46 / 125 » Routing in Trees |
EUC
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
TSMC
1998
14 years 9 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...
WOWMOM
2005
ACM
15 years 3 months ago
2005
ACM
—Hybrid networks are a promising architecture that builds ad hoc, wireless networks around the existing cellular telephony infrastructure. In this paper we present DST, a routing...
EURODAC
1994
IEEE
15 years 2 months ago
1994
IEEE
Clock routing has become a critical issue in the layout design of high-performance systems. We show that the two passes bottom-up and top-down of the DME algorithm 2, 3, 4, 8 can ...