Pages that link to "Item:Q671429"
From MaRDI portal
The following pages link to Limits and rates of convergence for the distribution of search cost under the move-to-front rule (Q671429):
Displaying 16 items.
- Stochastic ranking process with time dependent intensities (Q542907) (← links)
- Least-recently-used caching with dependent requests (Q703555) (← links)
- The limiting move-to-front search-cost in law of large numbers asymptotic regimes (Q968782) (← links)
- Functions of random walks on hyperplane arrangements (Q990770) (← links)
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities (Q1305419) (← links)
- Optimal timer-based caching policies for general arrival processes (Q1649968) (← links)
- Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process (Q1748560) (← links)
- Limiting search cost distribution for the move-to-front rule with random request probabilities (Q2480054) (← links)
- A fluid limit for a cache algorithm with general request processes (Q3059697) (← links)
- (Q3154671) (← links)
- SIZE-BIASED PERMUTATION OF DIRICHLET PARTITIONS AND SEARCH-COST DISTRIBUTION (Q4673902) (← links)
- On the distribution of the search cost for the move-to-front rule with random weights (Q4819452) (← links)
- The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms (Q4950714) (← links)
- (Q5094003) (← links)
- A Transposition Rule Analysis Based on a Particle Process (Q5312853) (← links)
- Enumerative theory for the Tsetlin library (Q6565648) (← links)