scholar.google.com › citations
In this paper we present new randomized algo- rithms for the snoopy-caching and spin-block prob- lems. For both of these problems, it is not possible to ...
Abstract. Competitive analysis is concerned with comparing the performance of on-line algorithms with that of optimal off-line algorithms.
Recommendations · Competitive randomized algorithms for nonuniform problems. Competitive analysis is concerned with comparing the performance of on-line ...
Sep 11, 1991 · In this paper we present new randomized on-line algorithms for snoopy caching and the spin-block problem. These algorithms achieve competitive ratios ...
Competitive analysis is concerned with comparing the performance of on-line algorithms with that of optimal off-line algorithms. In some cases randomization ...
We develop two deterministic and randomized algorithms that are provably robust against the poor performance of learning prediction, however, achieve the ...
Competitive analysis is concerned with comparing the performance of on-line algorithms with that of optimal off-line algorithms. In some cases randomization ...
People also ask
What are the two types of randomized algorithms?
What is the difference between Las Vegas and Monte Carlo algorithm?
What are the four complexity classes involving randomized algorithms?
What is the disadvantage of randomized algorithms?
Apr 3, 2012 · Does this mean that a randomized online algorithm for the same problem will also be not-competitive, or is there a case that it can be k- ...
Abstract. We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan.
We present a randomized algorithm which achieves a competitive ratio of e/(e − 1)n − 1/(e − 1) ≈ 1.5820n − 0.5820 for this same problem. For the uniform metric ...