46 search results - page 8 / 10 » On the topological lower bound for the multichromatic number |
153
click to vote
TMC
2012
13 years 2 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
ADHOC
2007
14 years 12 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
119
click to vote
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
130
click to vote
SPAA
1999
ACM
15 years 4 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
101
click to vote
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...