Pages that link to "Item:Q4079040"
From MaRDI portal
The following pages link to On self-organizing sequential search heuristics (Q4079040):
Displaying 41 items.
- On list update with locality of reference (Q269460) (← links)
- List update with probabilistic locality of reference (Q436596) (← links)
- Stochastic ranking process with time dependent intensities (Q542907) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- Least-recently-used caching with dependent requests (Q703555) (← links)
- On the optimality of the counter-scheme for dynamic linear lists (Q751280) (← links)
- Comparison of subdominant eigenvalues of some linear search schemes (Q840641) (← links)
- Fair service for mice in the presence of elephants (Q845690) (← links)
- Deterministic optimal and expedient move-to-rear list organizing strategies (Q914378) (← links)
- Stochastic rearrangement rules for self-organizing data structures (Q922688) (← links)
- Solution structures and sensitivity of special assignment problems (Q1086156) (← links)
- Self-organizing sequential search and Hilbert's inequalities (Q1104755) (← links)
- On linear search heuristics (Q1114411) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- On hash techniques in a paged environment (Q1138386) (← links)
- A generalized counter scheme (Q1156492) (← links)
- A new class of libraries (Q1194470) (← links)
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search (Q1201808) (← links)
- The weighted list update problem and the lazy adversary (Q1208728) (← links)
- On a generalization of binary search (Q1253101) (← links)
- Multiplicities of eigenvalues of some linear search schemes (Q1300850) (← links)
- Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities (Q1305419) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← links)
- On lookahead in the list update problem (Q1322123) (← links)
- Off-line algorithms for the list update problem (Q1350929) (← links)
- On the competitiveness of the move-to-front rule (Q1575556) (← links)
- Leading the field: fortune favors the bold in Thurstonian choice models (Q1715518) (← links)
- An exact formula for the move-to-front rule for self-organizing lists (Q1908208) (← links)
- Mixing of permutations by biased transpositions (Q2321931) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- The Move-to-Front Rule for Multiple Lists (Q3415956) (← links)
- The Application of Restricted Counter Schemes to Three Models of Linear Search (Q3416057) (← links)
- MOVE-FORWARD RULES AND <i>f</i>-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM (Q3431062) (← links)
- Amortized Computational Complexity (Q3735083) (← links)
- R�currence positive des librairies mixtes (Q3908273) (← links)
- (Q3965361) (← links)
- Comparison of different disk searching methods (Q4166196) (← links)
- (Q5094003) (← links)
- A Transposition Rule Analysis Based on a Particle Process (Q5312853) (← links)
- (Q6084346) (← links)
