Add to ORKGOver the past twelve years, online algorithms have received considerable research interest. Online problems had been investigated already in the seventies and early eighties but an extensive, systematic study started only when Sleator and Tarjan [41] suggested comparing an online algorithm to an optimal offline algorithm and Karlin, Manasse, Rudolph and Sleator [29] coined the term competitive analysis
On-line algorithms are usually analyzed using competitive analysis, in which the performance of on-l...
International audienceStochastic dominance is a technique for evaluating the performance of online a...
Online algorithms deal with settings where the input data arrives over time and the current decision...
Over the past ten years, online algorithms have re-ceived considerable research interest. Online pro...
This chapter presents an introduction to the competitive analysis of online algorithms. In an online...
Online algorithms are used in a variety of situations such as forex trading, cache replacement, and ...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
In the last 20 years competitive analysis has become the main tool for analyzing the quality of onli...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
Designing online algorithms with machine learning predictions is a recent technique beyond the worst...
In this thesis we present a randomized online algorithm for the 2-server problem on the line, named ...
This paper is devoted to the online dominating set problem and its variants. We believe the paper re...
Online learning and competitive analysis are two widely studied frameworks for online decision-makin...
We consider a model for online computation in which the online algorithm receives, together with eac...
Let be a set of on-line algorithms for a problem P with input set I . We assume that P can be ...
On-line algorithms are usually analyzed using competitive analysis, in which the performance of on-l...
International audienceStochastic dominance is a technique for evaluating the performance of online a...
Online algorithms deal with settings where the input data arrives over time and the current decision...
Over the past ten years, online algorithms have re-ceived considerable research interest. Online pro...
This chapter presents an introduction to the competitive analysis of online algorithms. In an online...
Online algorithms are used in a variety of situations such as forex trading, cache replacement, and ...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
In the last 20 years competitive analysis has become the main tool for analyzing the quality of onli...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
Designing online algorithms with machine learning predictions is a recent technique beyond the worst...
In this thesis we present a randomized online algorithm for the 2-server problem on the line, named ...
This paper is devoted to the online dominating set problem and its variants. We believe the paper re...
Online learning and competitive analysis are two widely studied frameworks for online decision-makin...
We consider a model for online computation in which the online algorithm receives, together with eac...
Let be a set of on-line algorithms for a problem P with input set I . We assume that P can be ...
On-line algorithms are usually analyzed using competitive analysis, in which the performance of on-l...
International audienceStochastic dominance is a technique for evaluating the performance of online a...
Online algorithms deal with settings where the input data arrives over time and the current decision...