Pages that link to "Item:Q881599"
From MaRDI portal
The following pages link to The relative worst-order ratio applied to paging (Q881599):
Displaying 23 items.
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
- Scheduling jobs on grid processors (Q973018) (← links)
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- Quantifying competitiveness in paging with locality of reference (Q1799211) (← links)
- List factoring and relative worst order analysis (Q1950393) (← links)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- A comparison of performance measures via online search (Q2445866) (← links)
- Relative interval analysis of paging algorithms on access graphs (Q2513607) (← links)
- Engineering Efficient Paging Algorithms (Q2828192) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
- The Frequent Items Problem in Online Streaming Under Various Performance Measures (Q2947799) (← links)
- Quantifying Competitiveness in Paging with Locality of Reference (Q3448771) (← links)
- Online Dual Edge Coloring of Paths and Trees (Q3453294) (← links)
- (Q5743508) (← links)
