Add to ORKGThis book chapter reviews fundamental concepts and results in the area of online algorithms. We first address classical online problems and then study various applications of current interest. Online algorithms represent a theoretical framework for studying prob
Topic classification: Algorithms and data structures We study scheduling problems in battery-operate...
This article initiates a theoretical investigation into online scheduling problems with speed scalin...
This article extends the study of online algorithms for energy-efficient deadline scheduling to the ...
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...
In computer science, the analysis of algorithms is the determination of the number of resources (suc...
This presentation surveys algorithmic techniques for energy savings. We address power-down as well a...
We initiate the systematic study of the energy complexity of algorithms (in addition to time and spa...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
We give a principled method to design online algorithms (for potentially non-linear problems) using ...
Abstract. The areas of On-Line Algorithms and Machine Learning are both concerned with problems of m...
Abstract—In this work, we argue that energy management should be a guiding principle for design and ...
Online algorithms deal with settings where the input data arrives over time and the current decision...
Existing work on scheduling with energy concern has focused on minimizing the energy for completing ...
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making deci...
Topic classification: Algorithms and data structures We study scheduling problems in battery-operate...
This article initiates a theoretical investigation into online scheduling problems with speed scalin...
This article extends the study of online algorithms for energy-efficient deadline scheduling to the ...
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...
In computer science, the analysis of algorithms is the determination of the number of resources (suc...
This presentation surveys algorithmic techniques for energy savings. We address power-down as well a...
We initiate the systematic study of the energy complexity of algorithms (in addition to time and spa...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
We give a principled method to design online algorithms (for potentially non-linear problems) using ...
Abstract. The areas of On-Line Algorithms and Machine Learning are both concerned with problems of m...
Abstract—In this work, we argue that energy management should be a guiding principle for design and ...
Online algorithms deal with settings where the input data arrives over time and the current decision...
Existing work on scheduling with energy concern has focused on minimizing the energy for completing ...
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making deci...
Topic classification: Algorithms and data structures We study scheduling problems in battery-operate...
This article initiates a theoretical investigation into online scheduling problems with speed scalin...
This article extends the study of online algorithms for energy-efficient deadline scheduling to the ...