68 search results - page 11 / 14 » Optimal Bounds for Matching Routing on Trees |
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
SODA
1998
ACM
14 years 10 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...
ICDE
2006
IEEE
15 years 3 months ago
2006
IEEE
XPORT (eXtensible Profile-driven Overlay Routing Trees) is a generic data dissemination system that supports an extensible set of data types and profiles, and an optimization fr...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...