Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference45 articles.
1. T. Kraska, A. Beutel, E.H. Chi, J. Dean, N. Polyzotis, The case for learned index structures, in: Proc. of the 2018 International Conference on Management of Data, SIGMOD, 2018, pp. 489–504.
2. Learning to run heuristics in tree search;Khalil,2017
3. D. Rohatgi, Near-Optimal Bounds for Online Caching with Machine Learned Advice, in: Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2020, pp. 1834–1845.
4. S. Lattanzi, T. Lavastida, B. Moseley, S. Vassilvitskii, Online Scheduling via Learned Weights, in: Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2020, pp. 1859–1877.
5. T. Lykouris, S. Vassilvitskii, Competitive Caching with Machine Learned Advice, in: Proc. of the 35th International Conference on Machine Learning, (ICML), Vol. 80, 2018, pp. 3302–3311.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献