Zobrazeno 1 - 10
of 240
pro vyhledávání: '"Boyar, Joan"'
With the developments in machine learning, there has been a surge in interest and results focused on algorithms utilizing predictions, not least in online algorithms where most new results incorporate the prediction aspect for concrete online problem
Externí odkaz:
http://arxiv.org/abs/2406.18265
In online interval scheduling, the input is an online sequence of intervals, and the goal is to accept a maximum number of non-overlapping intervals. In the more general disjoint path allocation problem, the input is a sequence of requests, each invo
Externí odkaz:
http://arxiv.org/abs/2302.13701
We consider the minimum spanning tree problem with predictions, using the weight-arrival model, i.e., the graph is given, together with predictions for the weights of all edges. Then the actual weights arrive one at a time and an irrevocable decision
Externí odkaz:
http://arxiv.org/abs/2302.12029
Quotable signature schemes are digital signature schemes with the additional property that from the signature for a message, any party can extract signatures for (allowable) quotes from the message, without knowing the secret key or interacting with
Externí odkaz:
http://arxiv.org/abs/2212.10963
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 variant of the online knapsack problem is considered in the settings of trusted and untrusted predictions. In Unit Profit Knapsack, the items have unit profit, and it is easy to find an optimal solution offline: Pack as many of the smallest items a
Externí odkaz:
http://arxiv.org/abs/2203.00285
Publikováno v:
In Theoretical Computer Science 12 February 2024 984
The priority model was introduced to capture "greedy-like" algorithms. Motivated by the success of advice complexity in the area of online algorithms, the fixed priority model was extended to include advice, and a reduction-based framework was develo
Externí odkaz:
http://arxiv.org/abs/1910.00868
The bin covering problem asks for covering a maximum number of bins with an online sequence of $n$ items of different sizes in the range $(0,1]$; a bin is said to be covered if it receives items of total size at least 1. We study this problem in the
Externí odkaz:
http://arxiv.org/abs/1905.00066
This work is a continuation of efforts to define and understand competitive analysis of algorithms in a distributed shared memory setting, which is surprisingly different from the classical online setting. In fact, in a distributed shared memory sett
Externí odkaz:
http://arxiv.org/abs/1807.06820