Sciweavers

1434 search results - page 12 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
14 years 25 days ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 7 months ago
Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
Libin Jiang, Jean C. Walrand
ICASSP
2008
IEEE
14 years 1 months ago
Distributed average consensus in sensor networks with quantized inter-sensor communication
— The paper studies distributed average consensus in sensor networks, when the sensors exchange quantized data at each time step. We show that randomizing the exchanged sensor da...
Soummya Kar, José M. F. Moura
COLCOM
2009
IEEE
14 years 5 days ago
A decentralized mechanism for application level monitoring of distributed systems
Abstract—For a complex distributed system to be dependable, it must be continuously monitored, so that its failures and imperfections can be discovered and corrected in a timely ...
Constantin Serban, Wenxuan Zhang, Naftaly H. Minsk...