OnlineMin: a fast strongly competitive randomized paging algorithm (Q2896387)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6056157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | OnlineMin: a fast strongly competitive randomized paging algorithm |
scientific article; zbMATH DE number 6056157 |
Statements
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm (English)
0 references
16 July 2012
0 references
0.9790935516357422
0 references
0.9110516905784608
0 references
0.8991634845733643
0 references
0.8933936953544617
0 references
0.864558219909668
0 references
