A strongly competitive randomized paging algorithm (Q808246)
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 strongly competitive randomized paging algorithm |
scientific article; zbMATH DE number 4209589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly competitive randomized paging algorithm |
scientific article; zbMATH DE number 4209589 |
Statements
A strongly competitive randomized paging algorithm (English)
0 references
1991
0 references
competitive algorithms
0 references
paging problem
0 references
partitioning algorithm
0 references
on-line algorithm
0 references
0.9312716126441956
0 references
0.9283909797668456
0 references
0.9110516905784608
0 references
0.9100154638290404
0 references
0.8942142128944397
0 references
