1017 search results - page 18 / 204 » On the Power of k -Consistency |
112
click to vote
MASCOTS
2008
15 years 1 months ago
2008
Abstract--In this paper, we investigate the problem of optimizing the lifetime of a mobile ad hoc network at a given degree k of connectivity by minimizing power consumption. Our p...
WCC
2005
Springer
15 years 5 months ago
2005
Springer
We present constructions of polyphase sequences suitable for the use as codewords in orthogonal frequency-division multiplexing (OFDM) with strictly bounded peak-to-mean envelope p...
ARCS
2006
Springer
15 years 3 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
102
click to vote
FCS
2006
15 years 1 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
SODA
2000
ACM
15 years 1 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...