The optimal structure of algorithms for \(\alpha\)-paging (Q495673)
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: The optimal structure of algorithms for -paging |
scientific article; zbMATH DE number 6482175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The optimal structure of algorithms for \(\alpha\)-paging |
scientific article; zbMATH DE number 6482175 |
Statements
The optimal structure of algorithms for \(\alpha\)-paging (English)
0 references
15 September 2015
0 references
paging
0 references
online algorithms
0 references
empirical competitive ratio
0 references
0.8740893
0 references
0.87167156
0 references
0 references
0.86919427
0 references
0.86850655
0 references
0.86840695
0 references
0.86840695
0 references
0.86800885
0 references
