𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Competitive paging algorithms

✍ Scribed by Amos Fiat; Richard M Karp; Michael Luby; Lyle A McGeoch; Daniel D Sleator; Neal E Young

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
949 KB
Volume
12
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Competitive analysis of randomized pagin
Competitive analysis of randomized paging algorithms
✍ Dimitris Achlioptas; Marek Chrobak; John Noga πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 130 KB

The paging problem is deΓΏned as follows: we are given a two-level memory system, in which one level is a fast memory, called cache, capable of holding k items, and the second level is an unbounded but slow memory. At each given time step, a request to an item is issued. Given a request to an item p,

On competitive on-line paging with looka
On competitive on-line paging with lookahead
✍ Dany Breslauer πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 833 KB

This paper studies two methods for improving the competitive efficiency of on-line paging algorithms: in the first, the on-line algorithm can use more pages; in the second, it is allowed to have a lookahead, or in other words, some partial knowledge of the future. The paper considers a new measure f

Competitive k-server algorithms
Competitive k-server algorithms
✍ Amos Fiat; Yuval Rabani; Yiftach Ravid πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 1008 KB

In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server conjecture up to the competitive ratio, The best previous result for general metric spaces was a three-server randomized competitive algorithm and a nonconstructive proof th

Competitive learning algorithms for vect
Competitive learning algorithms for vector quantization
✍ Stanley C. Ahalt; Ashok K. Krishnamurthy; Prakoon Chen; Douglas E. Melton πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 889 KB

We compare a number of training algorithms for competitive learning networks applied to the problem of vector quantization for data compression. A new competitive-learning algorithm based on the "conscience" learning method is introduced. The performance of competitive learning neural networks and t