Zobrazeno 1 - 10
of 1 926
pro vyhledávání: '"A Aspnes"'
Autor:
Amir, Talley, Aspnes, James
The population protocol model introduced by Angluin et al. in 2006 offers a theoretical framework for designing and analyzing distributed algorithms among limited-resource mobile agents. While the original population protocol model considers the conc
Externí odkaz:
http://arxiv.org/abs/2305.02377
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
For over five decades the procedure termed maximum-entropy (M-E) has been used to sharpen structure in spectra, optical and otherwise. However, this is a contradiction: by modifying data, this approach violates the fundamental M-E principle, which is
Externí odkaz:
http://arxiv.org/abs/2103.05513
Linear noise-reduction filters used in spectroscopy must strike a balance between reducing noise and preserving lineshapes, the two conflicting requirements of interest.
Externí odkaz:
http://arxiv.org/abs/2010.00987
Population protocols are a class of algorithms for modeling distributed computation in networks of finite-state agents communicating through pairwise interactions. Their suitability for analyzing numerous chemical processes has motivated the adaptati
Externí odkaz:
http://arxiv.org/abs/2009.08847
The standard population protocol model assumes that when two agents interact, each observes the entire state of the other agent. We initiate the study of $\textit{message complexity}$ for population protocols, where the state of an agent is divided i
Externí odkaz:
http://arxiv.org/abs/2003.09532
Autor:
Aspnes, James
Lecture notes for the Yale Computer Science course CPSC 469/569 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergraduate course on randomized algorithms. Discusses tools from probability t
Externí odkaz:
http://arxiv.org/abs/2003.01902
Autor:
Aspnes, James
Notes for the Yale course CPSC 465/565 Theory of Distributed Systems.
Comment: Updated for Fall 2023 semester
Comment: Updated for Fall 2023 semester
Externí odkaz:
http://arxiv.org/abs/2001.04235
We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impo
Externí odkaz:
http://arxiv.org/abs/1811.01421
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.