Near-Optimal Bounds for Online Caching With Machine Learned Advice

doi 10.1137/1.9781611975994.112
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Calculating Lower Bounds for Caching Problems

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2007English

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

2016English

Customising Parallelism and Caching for Machine Learning

English

Better Bounds for Online Scheduling

1997English

Lessons Learned: Five Pieces of Advice for Newbie Researchers

College and Research Libraries News
EducationLibraryInformation Sciences
2012English

Optimal Angle Bounds for Quadrilateral Meshes

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2010English

Fast State Tomography With Optimal Error Bounds

Journal of Physics A: Mathematical and Theoretical
StatisticsProbabilityNonlinear PhysicsSimulationMathematical PhysicsStatisticalModelingAstronomyPhysics
2020English

Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2005English

Online Coloring of Bipartite Graphs With and Without Advice

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy