2084 search results - page 199 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— Many of the distributed power control algorithms for wireless networks in the literature ignore the fact that while the algorithms necessitate communication among users, propag...
136
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
123
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
152
click to vote
ALGOSENSORS
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
137
click to vote
IPPS
2010
IEEE
15 years 13 days ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...