478 search results - page 33 / 96 » A simple expected running time analysis for randomized |
EJC
2007
13 years 8 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
PE
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at ...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
We propose a simple and energy efficient distributed Change Detection scheme for sensor networks based on Page’s parametric CUSUM algorithm. The sensor observations are IID ove...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...