2084 search results - page 342 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
106
click to vote
SIAMCOMP
2011
14 years 4 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
ICC
2011
IEEE
13 years 9 months ago
2011
IEEE
—In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter i...
TON
2010
14 years 8 months ago
2010
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is ...