Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Moran, Shlomo"'
We study several variants of a combinatorial game which is based on Cantor's diagonal argument. The game is between two players called Kronecker and Cantor. The names of the players are motivated by the known fact that Leopold Kronecker did not appre
Externí odkaz:
http://arxiv.org/abs/2301.01924
Autor:
Moran, Shlomo, Yavneh, Irad
In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and there is also a penalty for failing to solve the problem. The user may run
Externí odkaz:
http://arxiv.org/abs/2008.03676
``Real Normed Algebras Revisited,'' the last paper of the late Gadi Moran, attempts to reconstruct the discovery of the complex numbers, the quaternions and the octonions, as well as proofs of their properties, using only what was known to 19th centu
Externí odkaz:
http://arxiv.org/abs/2001.07521
In the stabilizing consensus problem, each agent of a networked system has an input value and is repeatedly writing an output value; it is required that eventually all the output values stabilize to the same value which, moreover, must be one of the
Externí odkaz:
http://arxiv.org/abs/1906.09073
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.
In this article, we study algorithms for dynamic networks with asynchronous start, i.e., each node may start running the algorithm in a different round. Inactive nodes transmit only heartbeats, which contain no information but can be detected by acti
Externí odkaz:
http://arxiv.org/abs/1706.07831
Publikováno v:
Distributed Computing, Springer, 2015
We revisit the classic problem of spreading a piece of information in a group of $n$ fully connected processors. By suitably adding a small dose of randomness to the protocol of Gasienic and Pelc (1996), we derive for the first time protocols that (i
Externí odkaz:
http://arxiv.org/abs/1209.6158
Autor:
Moran, Shlomo, Snir, Sagi
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex coloring of t
Externí odkaz:
http://arxiv.org/abs/cs/0505077
Publikováno v:
The Journal of Symbolic Logic, 2001 Mar 01. 66(1), 171-191.
Externí odkaz:
https://www.jstor.org/stable/2694916
Autor:
Charron-Bost, Bernadette1 (AUTHOR), Moran, Shlomo2 (AUTHOR) moran@cs.technion.ac.il
Publikováno v:
Distributed Computing. Jun2021, Vol. 34 Issue 3, p195-206. 12p.