Competitive algorithms for server problems (Q3485852)
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: Competitive algorithms for server problems |
scientific article; zbMATH DE number 4157859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Competitive algorithms for server problems |
scientific article; zbMATH DE number 4157859 |
Statements
Competitive algorithms for server problems (English)
0 references
1990
0 references
motion planning
0 references
scheduling
0 references
two headed disks
0 references
k-server problem
0 references
paging
0 references
caching
0 references
task systems
0 references
0.924919366836548
0 references
0.9051536917686462
0 references
0.905141830444336
0 references
0.8658310174942017
0 references
0.8609157204627991
0 references
