Name
Abstract | ||
|---|---|---|
We c onsider policies that manage fixed-size dynamic linear lists, when the references follo wt he independent reference model .W ed efine the counter scheme ,ap olic yt hat keeps the records sorted by their access frequencies, and prove t hat among all deterministic policies it produces the least expected cost of access, at an yt ime. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0020-0190(91)90040-O | Inf. Process. Lett. |
Keywords | Field | DocType |
dynamic linear list,counter scheme,reference model | Discrete mathematics,Computer science,Analysis of algorithms,Theoretical computer science,Independent Reference Model,Storage management,Artificial intelligence,Expected cost,List processing | Journal |
Volume | Issue | ISSN |
37 | 3 | 0020-0190 |
Citations | PageRank | References |
3 | 0.46 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Micha Hofri | 1 | 342 | 127.96 |
| Hadas Schachnai | 2 | 3 | 0.46 |