Sciweavers

1612 search results - page 21 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Time-space-sequential algorithms for distributed Bayesian state estimation in serial sensor networks
We consider distributed estimation of a time-dependent, random state vector based on a generally nonlinear/non-Gaussian state-space model. The current state is sensed by a serial ...
Ondrej Hlinka, Franz Hlawatsch
ISPDC
2008
IEEE
14 years 1 months ago
Token Loss Detection for Random Walk based Algorithm
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
Thibault Bernard, Alain Bui, Devan Sohier
SPDP
1991
IEEE
13 years 11 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
14 years 1 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
JDA
2008
85views more  JDA 2008»
13 years 7 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...