A short proof of optimality for the MIN cache replacement algorithm (Q845965)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A short proof of optimality for the MIN cache replacement algorithm |
scientific article; zbMATH DE number 5664781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short proof of optimality for the MIN cache replacement algorithm |
scientific article; zbMATH DE number 5664781 |
Statements
A short proof of optimality for the MIN cache replacement algorithm (English)
0 references
29 January 2010
0 references
analysis of algorithms
0 references
on-line algorithms
0 references
caching
0 references
paging
0 references
0.9870118
0 references
0.9643432
0 references
0.85694057
0 references
0.8561297
0 references
0.8546364
0 references
0.8478636
0 references
0.8435188
0 references
0.8413749
0 references
