Zobrazeno 1 - 10
of 127
pro vyhledávání: '"Hromkovic, Juraj"'
Autor:
Böckenhauer, Hans-Joachim, Gehnen, Matthias, Hromkovič, Juraj, Klasing, Ralf, Komm, Dennis, Lotze, Henri, Mock, Daniel, Rossmanith, Peter, Stocker, Moritz
We analyze the competitive ratio and the advice complexity of the online unbounded knapsack problem. An instance is given as a sequence of n items with a size and a value each, and an algorithm has to decide how often to pack each item into a knapsac
Externí odkaz:
http://arxiv.org/abs/2407.02045
Autor:
Boeckenhauer, Hans-Joachim, Burjons, Elisabet, Frei, Fabian, Hromkovic, Juraj, Lotze, Henri, Rossmanith, Peter
In the online simple knapsack problem items are presented in an iterative fashion and an algorithm has to decide for each item whether to reject or permanently include it into the knapsack without any knowledge about the rest of the instance. The goa
Externí odkaz:
http://arxiv.org/abs/2009.14043
The online search problem is a fundamental problem in finance. The numerous direct applications include searching for optimal prices for commodity trading and trading foreign currencies. In this paper, we analyze the advice complexity of this problem
Externí odkaz:
http://arxiv.org/abs/1612.09299
Publikováno v:
Informatics in Education - An International Journal. 20(3):333-360
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=979290
In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum Topic-Connected Overlay problem (Min-TCO in short) has been investigated: Given a set of t topics and a collection of n use
Externí odkaz:
http://arxiv.org/abs/1107.2443
Autor:
Hromkovic, Juraj, Schnitger, Georg
Publikováno v:
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 553-564
The ambiguity of a nondeterministic finite automaton (NFA) N for input size n is the maximal number of accepting computations of N for an input of size n. For all k, r 2 N we construct languages Lr,k which can be recognized by NFA's with size k poly(
Externí odkaz:
http://arxiv.org/abs/0902.2140
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bianchi, Maria Paola, Böckenhauer, Hans-Joachim, Hromkovič, Juraj, Krug, Sacha, Steffen, Björn
Publikováno v:
In Theoretical Computer Science 16 October 2014 554:22-39
Autor:
Böckenhauer, Hans-Joachim, Hromkovič, Juraj, Komm, Dennis, Krug, Sacha, Smula, Jasmin, Sprock, Andreas
Publikováno v:
In Theoretical Computer Science 16 October 2014 554:95-108