๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the competitive ratio of the work function algorithm for the k-server problem

โœ Scribed by Yair Bartal; Elias Koutsoupias

Book ID
108280966
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
209 KB
Volume
324
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A better lower bound on the competitive
A better lower bound on the competitive ratio of the randomized 2-server problem
โœ Marek Chrobak; Lawrence L. Larmore; Carsten Lund; Nick Reingold ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 482 KB

We present a lower bound of 1 + e-"' z 1.6065 on the competitive ratio of randomized algorithms for the weighted 2-cache problem, which is a special case of the 2-server problem. This improves the previously best known lower bound of e/(e-1) N 1.582 for both problems. @

On the Power Function of the Likelihood
On the Power Function of the Likelihood Ratio Test for MANOVA
โœ Dulal Kumar Bhaumik; Sanat K. Sarka ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 77 KB

We prove that the power function of the likelihood ratio test for MANOVA attains its minimum when the rank of the location parameter matrix G decreases from s to 1. This provides a theoretical justification of a result that is known in the literature based only on numerical studies.