暂无分享,去创建一个
Adam Wierman | Bo Sun | Mohammad Hajiesmaili | Ali Zeynali | A. Wierman | Bo Sun | M. Hajiesmaili | A. Zeynali
[1] Rahul Vaze,et al. Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks , 2013, IEEE/ACM Transactions on Networking.
[2] Jian Li,et al. Learning-Assisted Competitive Algorithms for Peak-Aware Energy Scheduling , 2019, ArXiv.
[3] Jingdong Xu,et al. Online Resource Allocation, Content Placement and Request Routing for Cost-Efficient Edge Caching in Cloud Radio Access Networks , 2018, IEEE Journal on Selected Areas in Communications.
[4] Hari Balakrishnan,et al. TCP ex machina: computer-generated congestion control , 2013, SIGCOMM.
[5] Ran El-Yaniv,et al. Optimal Search and One-Way Trading Online Algorithms , 2001, Algorithmica.
[6] Enrique Mallada,et al. Online EV Scheduling Algorithms for Adaptive Charging Networks with Global Peak Constraints , 2022, IEEE Transactions on Sustainable Computing.
[7] Sergei Vassilvitskii,et al. Competitive caching with machine learned advice , 2018, ICML.
[8] Tapani Raiko,et al. European conference on machine learning and knowledge discovery in databases , 2014 .
[9] Maria-Florina Balcan,et al. Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[10] Lars Kotthoff,et al. An evaluation of machine learning in algorithm selection for search problems , 2012, AI Commun..
[11] Jian Tang,et al. Energy-efficient collaborative sensing with mobile phones , 2012, 2012 Proceedings IEEE INFOCOM.
[12] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[13] Rahul Vaze,et al. The online disjoint set cover problem and its applications , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).
[14] Dennis Komm,et al. The online knapsack problem: Advice and randomization , 2014, Theor. Comput. Sci..
[15] Joan Boyar,et al. Online Algorithms with Advice: A Survey , 2016, SIGA.
[16] Varun Kanade,et al. Online Optimization of Smoothed Piecewise Constant Functions , 2016, AISTATS.
[17] Tim Roughgarden,et al. A PAC Approach to Application-Specific Algorithm Selection , 2015, SIAM J. Comput..
[18] Google,et al. Improving Online Algorithms via ML Predictions , 2024, NeurIPS.
[19] Rahul Vaze,et al. Optimally Approximating the Lifetime of Wireless Sensor Networks , 2013, ArXiv.
[20] Soumya Banerjee,et al. Improving Online Rent-or-Buy Algorithms with Sequential Decision Making and ML Predictions , 2020, NeurIPS.
[21] Adam Wierman,et al. Using Predictions in Online Optimization: Looking Forward with an Eye on the Past , 2016, SIGMETRICS.
[22] Joseph Naor,et al. The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..
[23] Yoav Shoham,et al. Empirical hardness models: Methodology and a case study on combinatorial auctions , 2009, JACM.
[24] Christoph Dürr,et al. Online Computation with Untrusted Advice , 2019, ITCS.
[25] Matthew Mathis,et al. Automatic TCP buffer tuning , 1998, SIGCOMM '98.
[26] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[27] Lachlan L. H. Andrew,et al. Online Convex Optimization Using Predictions , 2015, SIGMETRICS.
[28] Adam Wierman,et al. Competitive Online Optimization under Inventory Constraints , 2019, Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems.
[29] Minghua Chen,et al. Simple and effective dynamic provisioning for power-proportional data centers , 2011, 2012 46th Annual Conference on Information Sciences and Systems (CISS).
[30] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..
[31] Tim Roughgarden,et al. Data-driven algorithm design , 2020, Commun. ACM.
[32] Maria-Florina Balcan,et al. Semi-bandit Optimization in the Dispersed Setting , 2019, UAI.
[33] Kevin Leyton-Brown,et al. Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration , 2019, NeurIPS.
[34] Jun Li,et al. Online Resource Allocation for Arbitrary User Mobility in Distributed Edge Clouds , 2017, 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).
[35] Rémi Munos,et al. Online Learning in Adversarial Lipschitz Environments , 2010, ECML/PKDD.
[36] Zhenhua Liu,et al. Online Optimization in Cloud Resource Provisioning: Predictions, Regrets, and Algorithms , 2019, Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems.
[37] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[38] Minghua Chen,et al. Online energy generation scheduling for microgrids with intermittent energy sources and co-generation , 2012, SIGMETRICS '13.
[39] Dhruv Rohatgi,et al. Near-Optimal Bounds for Online Caching with Machine Learned Advice , 2019, SODA.
[40] Adam Tauman Kalai,et al. Learning to Prune: Speeding up Repeated Computations , 2019, COLT.
[41] Deeparnab Chakrabarty,et al. Budget constrained bidding in keyword auctions and online knapsack problems , 2008, WINE.
[42] Joaquim Celestino,et al. Using the Multiple Knapsack Problem to Model the Problem of Virtual Machine Allocation in Cloud Computing , 2013, 2013 IEEE 16th International Conference on Computational Science and Engineering.
[43] Luca De Cicco,et al. ERUDITE: a deep neural network for optimal tuning of adaptive video streaming controllers , 2019, MMSys.
[44] Pierre Fraigniaud,et al. Online computation with advice , 2011, Theor. Comput. Sci..
[45] Silvio Lattanzi,et al. Online Scheduling via Learned Weights , 2020, SODA.
[46] Noga Alon,et al. The online set cover problem , 2003, STOC '03.
[47] Tongxin Li,et al. Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging , 2020, Proc. ACM Meas. Anal. Comput. Syst..
[48] Kane,et al. Beyond the Worst-Case Analysis of Algorithms , 2020 .
[49] Noel Crespi,et al. Online EV Charging Scheduling With On-Arrival Commitment , 2019, IEEE Transactions on Intelligent Transportation Systems.
[50] Ola Svensson,et al. The Primal-Dual method for Learning Augmented Algorithms , 2020, NeurIPS.
[51] D. Sculley,et al. Google Vizier: A Service for Black-Box Optimization , 2017, KDD.
[52] Dennis Komm,et al. On the Advice Complexity of the Set Cover Problem , 2012, CSR.
[53] Sreenivas Gollapudi,et al. Online Algorithms for Rent-Or-Buy with Expert Advice , 2019, ICML.
[54] Fred Zhang,et al. Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms , 2020, NeurIPS.
[55] Lachlan L. H. Andrew,et al. Dynamic Right-Sizing for Power-Proportional Data Centers , 2011, IEEE/ACM Transactions on Networking.
[56] Rohan Kodialam,et al. Optimal Algorithms for Ski Rental with Soft Machine-Learned Predictions , 2019, ArXiv.
[57] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[58] Zongpeng Li,et al. Online Auctions in IaaS Clouds: Welfare and Profit Maximization With Server Costs , 2015, IEEE/ACM Transactions on Networking.
[59] Zongpeng Li,et al. Optimal Posted Prices for Online Cloud Resource Allocation , 2017, Proc. ACM Meas. Anal. Comput. Syst..
[60] Antonios Antoniadis,et al. Secretary and Online Matching Problems with Machine Learned Advice , 2020, NeurIPS.
[61] Dennis Komm,et al. On the Advice Complexity of Online Problems , 2009, ISAAC.
[62] Bruno Ribeiro,et al. Oboe: auto-tuning video ABR algorithms to network conditions , 2018, SIGCOMM.