511 search results - page 25 / 103 » Lower bounds for distributed markov chain problems |
ISAAC
1998
Springer
14 years 5 days ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
SPAA
1994
ACM
14 years 19 hour ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...