1612 search results - page 6 / 323 » Analysing Randomized Distributed Algorithms |
119
click to vote
PODS
2012
ACM
13 years 2 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract- Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)...
116
click to vote
TSP
2010
14 years 6 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
CLUSTER
2006
IEEE
15 years 5 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
RSA
2002
14 years 11 months ago
2002
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...