This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
Pascal Van Hentenryck, Russell Bent, Yannis Vergad...
On-line boosting is a recent advancement in the field of machine learning that has opened a new spectrum of possibilities in many diverse fields. With respect to a static strong...
Ingrid Visentini, Lauro Snidaro, Gian Luca Foresti
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...