Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Biermeier, Felix"'
In the classical Approximate Majority problem with two opinions there are agents with Opinion 1 and with Opinion 2. The goal is to reach consensus and to agree on the majority opinion if the bias is sufficiently large. It is well known that the probl
Externí odkaz:
http://arxiv.org/abs/2406.07335
Autor:
Bankhamer, Gregor, Berenbrink, Petra, Biermeier, Felix, Elsässer, Robert, Hosseinpour, Hamed, Kaaser, Dominik, Kling, Peter
We consider the \emph{exact plurality consensus} problem for \emph{population protocols}. Here, $n$ anonymous agents start each with one of $k$ opinions. Their goal is to agree on the initially most frequent opinion (the \emph{plurality opinion}) via
Externí odkaz:
http://arxiv.org/abs/2402.06471
Autor:
Amir, Talley, Aspnes, James, Berenbrink, Petra, Biermeier, Felix, Hahn, Christopher, Kaaser, Dominik, Lazarsfeld, John
We analyze the convergence of the $k$-opinion Undecided State Dynamics (USD) in the population protocol model. For $k$=2 opinions it is well known that the USD reaches consensus with high probability within $O(n \log n)$ interactions. Proving that th
Externí odkaz:
http://arxiv.org/abs/2302.12508
We present a loosely-stabilizing phase clock for population protocols. In the population model we are given a system of $n$ identical agents which interact in a sequence of randomly chosen pairs. Our phase clock is leaderless and it requires $O(\log
Externí odkaz:
http://arxiv.org/abs/2106.13002
Autor:
Bankhamer, Gregor, Berenbrink, Petra, Biermeier, Felix, Elsässer, Robert, Hosseinpour, Hamed, Kaaser, Dominik, Kling, Peter
We consider the plurality consensus problem among $n$ agents. Initially, each agent has one of $k$ different opinions. Agents choose random interaction partners and revise their state according to a fixed transition function, depending on their own s
Externí odkaz:
http://arxiv.org/abs/2103.10366
We consider the scenario of $n$ sensor nodes observing streams of data. The nodes are connected to a central server whose task it is to compute some function over all data items observed by the nodes. In our case, there exists a total order on the da
Externí odkaz:
http://arxiv.org/abs/1709.07259
Autor:
Bemmann, Pascal, Biermeier, Felix, Bürmann, Jan, Kemper, Arne, Knollmann, Till, Knorr, Steffen, Kothe, Nils, Mäcker, Alexander, Malatyali, Manuel, der Heide, Friedhelm Meyer auf, Riechers, Sören, Schaefer, Johannes, Sundermeier, Jannik
Consider a network in which $n$ distributed nodes are connected to a single server. Each node continuously observes a data stream consisting of one value per discrete time step. The server has to continuously monitor a given parameter defined over al
Externí odkaz:
http://arxiv.org/abs/1706.03568
Autor:
Bankhamer, Gregor, Berenbrink, Petra, Biermeier, Felix, Elsässer, Robert, Hosseinpour, Hamed, Kaaser, Dominik, Kling, Peter
Publikováno v:
Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA'22)
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c80e4a812a29d3855ecf54388c44cf07
https://doi.org/10.1137/1.9781611977073.135
https://doi.org/10.1137/1.9781611977073.135
Autor:
Antoniadis, Antonios, Cristi, Andrés, Hoeksma, Ruben, Kling, Peter, Biermeier, Felix, Damerius, Christoph, Kaaser, Dominik, Nölke, Lukas, Bender, Michael A., Svensson, Ola, Herman, Grzegorz
Publikováno v:
27th Annual European Symposium on Algorithms
Leibniz International Proceedings in Informatics
27th Annual European Symposium on Algorithms, ESA 2019, 1-14
STARTPAGE=1;ENDPAGE=14;TITLE=27th Annual European Symposium on Algorithms, ESA 2019
Leibniz International Proceedings in Informatics
27th Annual European Symposium on Algorithms, ESA 2019, 1-14
STARTPAGE=1;ENDPAGE=14;TITLE=27th Annual European Symposium on Algorithms, ESA 2019
In the Anchored Rectangle Packing (ARP) problem, we are given a set of points P in the unit square [0,1]^2 and seek a maximum-area set of axis-aligned interior-disjoint rectangles S, each of which is anchored at a point p in P. In the most prominent