Sciweavers

725 search results - page 108 / 145
» Bounding Degrees on RPL
Sort
View
ADHOCNOW
2008
Springer
15 years 12 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
AINA
2007
IEEE
15 years 12 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
MFCS
2007
Springer
15 years 11 months ago
NP by Means of Lifts and Shadows
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
Gábor Kun, Jaroslav Nesetril
3DIM
2005
IEEE
15 years 11 months ago
Discrete Pose Space Estimation to Improve ICP-Based Tracking
Iterative Closest Point (ICP) -based tracking works well when the interframe motion is within the ICP minimum well space. For large interframe motions resulting from a limited sen...
Limin Shang, Piotr Jasiobedzki, Michael A. Greensp...
HIPC
2004
Springer
15 years 11 months ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula