The following pages link to Beyond Competitive Analysis (Q4507350):
Displaying 16 items.
- Online network design with outliers (Q334928) (← links)
- Optimal eviction policies for stochastic address traces (Q386897) (← links)
- List update with probabilistic locality of reference (Q436596) (← links)
- The \(k\)-server problem (Q458484) (← links)
- The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
- Knowledge state algorithms (Q548658) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- Scheduling search procedures: The wheel of fortune (Q880568) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- Probabilistic analysis for scheduling with conflicts (Q924143) (← links)
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
