Add to ORKGThis chapter presents an introduction to the competitive analysis of online algorithms. In an online problem..
International audienceWe consider the problem of scheduling jobs on-line on a single machine with th...
This thesis proposes and evaluates some online algorithms for machine scheduling problems. Determini...
We study the relationship between the competitive ratio and the tail distribution of randomized onli...
Over the past ten years, online algorithms have re-ceived considerable research interest. Online pro...
Over the past twelve years, online algorithms have received considerable research interest. Online p...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
We consider a model for online computation in which the online algorithm receives, together with eac...
We consider the problem of scheduling a maximum profit selection of jobs on m identical machines. Jo...
Let be a set of on-line algorithms for a problem P with input set I . We assume that P can be ...
Online optimization, in contrast to classical optimization, deals with optimization problems whose i...
This paper is devoted to the online dominating set problem and its variants. We believe the paper re...
The single machine semi-online scheduling problem with the objective of minimizing total completion ...
We generalize the model of online computation with three players (algorithm, adversary and an oracle...
This thesis presents results of our research in the area of optimization problems with incomplete in...
International audienceWe consider the problem of scheduling jobs on-line on a single machine with th...
This thesis proposes and evaluates some online algorithms for machine scheduling problems. Determini...
We study the relationship between the competitive ratio and the tail distribution of randomized onli...
Over the past ten years, online algorithms have re-ceived considerable research interest. Online pro...
Over the past twelve years, online algorithms have received considerable research interest. Online p...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
We consider a model for online computation in which the online algorithm receives, together with eac...
We consider the problem of scheduling a maximum profit selection of jobs on m identical machines. Jo...
Let be a set of on-line algorithms for a problem P with input set I . We assume that P can be ...
Online optimization, in contrast to classical optimization, deals with optimization problems whose i...
This paper is devoted to the online dominating set problem and its variants. We believe the paper re...
The single machine semi-online scheduling problem with the objective of minimizing total completion ...
We generalize the model of online computation with three players (algorithm, adversary and an oracle...
This thesis presents results of our research in the area of optimization problems with incomplete in...
International audienceWe consider the problem of scheduling jobs on-line on a single machine with th...
This thesis proposes and evaluates some online algorithms for machine scheduling problems. Determini...
We study the relationship between the competitive ratio and the tail distribution of randomized onli...