2084 search results - page 262 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
105
click to vote
WSNA
2003
ACM
15 years 3 months ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
AUTOMATICA
2006
14 years 10 months ago
2006
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
UAI
2003
14 years 11 months ago
2003
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...