The following pages link to Chasing Convex Bodies Optimally (Q5146869):
Displaying 8 items.
- Chasing Convex Bodies with Linear Competitive Ratio (Q5056421) (← links)
- A Nearly-Linear Bound for Chasing Nested Convex Bodies (Q5236189) (← links)
- Algorithms for energy conservation in heterogeneous data centers (Q5925533) (← links)
- Algorithms for energy conservation in heterogeneous data centers (Q5925673) (← links)
- Lipschitz selectors may not yield competitive algorithms for convex body chasing (Q6050222) (← links)
- Online geometric covering and piercing (Q6614105) (← links)
- Deterministic 3-server on a circle and the limitation of canonical potentials (Q6634376) (← links)
- Online paging with heterogeneous cache slots (Q6670814) (← links)