2814 search results - page 67 / 563 » Competitive Analysis of Distributed Algorithms |
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— Many distributed multiple access (MAC) protocols use an exponential backoff mechanism. In that mechanism, a node picks a random backoff time uniformly in an interval that doubl...
TMC
2008
13 years 9 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
STOC
2005
ACM
14 years 10 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
VLSISP
1998
13 years 9 months ago
1998
This paper presents an adaptive structure self-organizing finite mixture network for quantification of magnetic resonance (MR) brain image sequences. We present justification fo...
TSP
2010
13 years 4 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...