Pages that link to "Item:Q1312188"
From MaRDI portal
The following pages link to A new measure for the study of on-line algorithms (Q1312188):
Displayed 37 items.
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- On the online min-wait relocation problem (Q324815) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- A note on the \(k\)-Canadian traveller problem (Q963338) (← links)
- Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- On competitive on-line paging with lookahead (Q1276313) (← 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)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- List factoring and relative worst order analysis (Q1950393) (← links)
- Exact distributional analysis of online algorithms with lookahead (Q2044551) (← links)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
- Generalized Canadian traveller problems (Q2343992) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (Q2352354) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← 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)
- Approximating the Canadian traveller problem with online randomization (Q2663716) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Quantifying Competitiveness in Paging with Locality of Reference (Q3448771) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- Measuring the problem-relevant information in input (Q5321779) (← links)
- On the Relative Dominance of Paging Algorithms (Q5387781) (← links)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis (Q5452148) (← links)
- List Update with Locality of Reference (Q5458546) (← links)
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem (Q5505679) (← links)
- Online Bounded Analysis (Q5740182) (← links)
- (Q5743508) (← links)