Pages that link to "Item:Q1908208"
From MaRDI portal
The following pages link to An exact formula for the move-to-front rule for self-organizing lists (Q1908208):
Displayed 11 items.
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule (Q671429) (← links)
- Least-recently-used caching with dependent requests (Q703555) (← links)
- Comparison of subdominant eigenvalues of some linear search schemes (Q840641) (← links)
- The limiting move-to-front search-cost in law of large numbers asymptotic regimes (Q968782) (← links)
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities (Q1305419) (← links)
- Random walks and hyperplane arrangements (Q1307466) (← links)
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements (Q1974939) (← links)
- The move-to-partner rule for self-organizing task allocation on a linear array (Q4532399) (← links)
- The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms (Q4950714) (← links)
- A Transposition Rule Analysis Based on a Particle Process (Q5312853) (← links)
- Critical sizing of LRU caches with dependent requests (Q5441519) (← links)