Pages that link to "Item:Q1305419"

The following pages link to Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities (Q1305419):

Displaying 13 items.

• Transient and steady-state regime of a family of list-based cache replacement algorithms (Q335905) (← links)
• 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)
• 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)
• Performance of the move-to-front algorithm with Markov-modulated request sequences (Q1962831) (← links)
• The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp (Q2954242) (← links)
• A fluid limit for a cache algorithm with general request processes (Q3059697) (← links)
• On the distribution of the search cost for the move-to-front rule with random weights (Q4819452) (← links)
• (Q5094003) (← links)
• A Transposition Rule Analysis Based on a Particle Process (Q5312853) (← links)
• Critical sizing of LRU caches with dependent requests (Q5441519) (← links)