Login / Signup
Practical Bounds on Optimal Caching with Variable Object Sizes.
Daniel S. Berger
Nathan Beckmann
Mor Harchol-Balter
Published in:
Proc. ACM Meas. Anal. Comput. Syst. (2018)
Keyphrases
</>
worst case
moving objects
real world
dynamic programming
upper bound
optimal cost
asymptotically optimal
optimal control
query processing
three dimensional
lower bound
data access
optimal solution
target object
access patterns
tight bounds
image segmentation