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):
Displaying 32 items.
- A note on an alternating upper bound for random walks on semigroups (Q403558) (← links)
- Generalizations of an expansion formula for top to random shuffles (Q505704) (← links)
- Stochastic ranking process with time dependent intensities (Q542907) (← links)
- Edge flipping in graphs (Q651046) (← links)
- 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)
- Properties of the promotion Markov chain on linear extensions (Q722819) (← 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)
- Leading the field: fortune favors the bold in Thurstonian choice models (Q1715518) (← links)
- Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process (Q1748560) (← links)
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements (Q1974939) (← links)
- The eigenvalues of hyperoctahedral descent operators and applications to card-shuffling (Q2121769) (← links)
- Combinatorial Markov chains on linear extensions (Q2248568) (← links)
- Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement (Q2312684) (← links)
- Lumpings of algebraic Markov chains arise from subquotients (Q2330411) (← links)
- Markov chains on graded posets. Compatibility of up-directed and down-directed transition probabilities (Q2413415) (← links)
- Eigenvalues of LRU via a linear algebraic approach (Q2417099) (← links)
- (Q3484346) (← links)
- Self-organizing lists and independent references: A statistical synergy (Q3988820) (← 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)
- Hypergraph Coloring Games and Voter Models (Q4985349) (← links)
- Upper Bounds on Mixing Time of Finite Markov Chains (Q5055645) (← links)
- (Q5094003) (← links)
- Markov Chains for Promotion Operators (Q5112365) (← links)
- A Transposition Rule Analysis Based on a Particle Process (Q5312853) (← links)
- Critical sizing of LRU caches with dependent requests (Q5441519) (← links)
- Antiduality and Möbius monotonicity: generalized coupon collector problem (Q5881046) (← links)
- The one-sided cycle shuffles in the symmetric group algebra (Q6495792) (← links)