The following pages link to Markov Paging (Q4507377):
Displaying 18 items.
- Online network design with outliers (Q334928) (← links)
- Optimal eviction policies for stochastic address traces (Q386897) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
- Quantifying competitiveness in paging with locality of reference (Q1799211) (← links)
- Competitive caching of query results in search engines (Q1887088) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- Data structures on event graphs (Q2350906) (← links)
- Relative interval analysis of paging algorithms on access graphs (Q2513607) (← links)
- Quantifying Competitiveness in Paging with Locality of Reference (Q3448771) (← links)
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison (Q3541114) (← links)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis (Q5452148) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- Markov incremental constructions (Q5896960) (← links)
