Zobrazeno 1 - 10
of 343
pro vyhledávání: '"Antoniadis, Antonios P"'
We introduce learning augmented algorithms to the online graph coloring problem. Although the simple greedy algorithm FirstFit is known to perform poorly in the worst case, we are able to establish a relationship between the structure of any input gr
Externí odkaz:
http://arxiv.org/abs/2312.00601
Autor:
Winschermann, Leoni, Gerards, Marco E. T., Antoniadis, Antonios, Hoogsteen, Gerwin, Hurink, Johann
Due to the ongoing electrification of transport in combination with limited power grid capacities, efficient ways to schedule the charging of electric vehicles (EVs) are needed for the operation of, for example, large parking lots. Common approaches
Externí odkaz:
http://arxiv.org/abs/2309.06174
A major technique in learning-augmented online algorithms is combining multiple algorithms or predictors. Since the performance of each predictor may vary over time, it is desirable to use not the single best predictor as a benchmark, but rather a dy
Externí odkaz:
http://arxiv.org/abs/2304.01781
Autor:
Antoniadis, Antonios, Boyar, Joan, Eliáš, Marek, Favrholdt, Lene M., Hoeksma, Ruben, Larsen, Kim S., Polak, Adam, Simon, Bertrand
Paging is a prototypical problem in the area of online algorithms. It has also played a central role in the development of learning-augmented algorithms -- a recent line of research that aims to ameliorate the shortcomings of classical worst-case ana
Externí odkaz:
http://arxiv.org/abs/2210.02775
A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the minimum-area co
Externí odkaz:
http://arxiv.org/abs/2208.07567
Given the rapid rise in energy demand by data centers and computing systems in general, it is fundamental to incorporate energy considerations when designing (scheduling) algorithms. Machine learning can be a useful approach in practice by predicting
Externí odkaz:
http://arxiv.org/abs/2112.03082
We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs
Externí odkaz:
http://arxiv.org/abs/2110.13116
We consider the online search problem in which a server starting at the origin of a $d$-dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competitive ratio and the length of the shortest curve from which each point on
Externí odkaz:
http://arxiv.org/abs/2109.04340
Consider the problem where $n$ jobs, each with a release time, a deadline and a required processing time are to be feasibly scheduled in a single- or multi-processor setting so as to minimize the total energy consumption of the schedule. A processor
Externí odkaz:
http://arxiv.org/abs/2107.07800
We consider the problem of managing the buffer of a shared-memory switch that transmits packets of unit value. A shared-memory switch consists of an input port, a number of output ports, and a buffer with a specific capacity. In each time step, an ar
Externí odkaz:
http://arxiv.org/abs/2012.03906