2084 search results - page 93 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
ALGOSENSORS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule tra...
CCGRID
2005
IEEE
15 years 3 months ago
2005
IEEE
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
AAECC
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algor...