1541 search results - page 14 / 309 » Analysis of Random Noise and Random Walk Algorithms |
IPPS
1998
IEEE
14 years 6 days ago
1998
IEEE
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
WIA
2009
Springer
14 years 2 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
STOC
1993
ACM
14 years 14 hour ago
1993
ACM