Uniform Loss Algorithms for Online Stochastic Decision-Making With Applications to Bin Packing
Abstract
References
- Uniform Loss Algorithms for Online Stochastic Decision-Making With Applications to Bin Packing
Recommendations
Uniform Loss Algorithms for Online Stochastic Decision-Making With Applications to Bin Packing
SIGMETRICS '20: Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsWe consider a general class of finite-horizon online decision-making problems, where in each period a controller is presented a stochastic arrival and must choose an action from a set of permissible actions, and the final objective depends only on the ...
Online Bin Packing with Advice of Small Size
In this paper, we study the advice complexity of the online bin packing problem. In this well-studied setting, the online algorithm is supplemented with some additional information concerning the input. We improve upon both known upper and lower bounds ...
On the Fault-Tolerant Online Bin Packing Problem
Algorithmic Aspects of Cloud ComputingAbstractWe study the fault-tolerant variant of the online bin packing problem. Similar to the classic online bin packing problem, an online sequence of items of various sizes should be packed into a minimum number of bins of uniform capacity. For ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 33Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in