Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Eguchi, Ryota"'
The population protocol model is a computational model for passive mobile agents. We address the leader election problem, which determines a unique leader on arbitrary communication graphs starting from any configuration. Unfortunately, self-stabiliz
Externí odkaz:
http://arxiv.org/abs/2411.03902
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undirected graph, the meeting times are defined as the expected times until
Externí odkaz:
http://arxiv.org/abs/2305.11590
In the rendezvous problem, two computing entities (called \emph{agents}) located at different vertices in a graph have to meet at the same vertex. In this paper, we consider the synchronous \emph{neighborhood rendezvous problem}, where the agents are
Externí odkaz:
http://arxiv.org/abs/2105.03638
We consider the leader election problem in population protocol models. In pragmatic settings of population protocols, self-stabilization is a highly desired feature owing to its fault resilience and the benefit of initialization freedom. However, the
Externí odkaz:
http://arxiv.org/abs/2005.09944
Autor:
Lin, Chaojing, Eguchi, Ryota, Hashisaka, Masayuki, Akiho, Takafumi, Muraki, Koji, Fujisawa, Toshimasa
Charge equilibration between quantum-Hall edge states can be studied to reveal geometric structure of edge channels not only in the integer quantum Hall (IQH) regime but also in the fractional quantum Hall (FQH) regime particularly for hole-conjugate
Externí odkaz:
http://arxiv.org/abs/1905.01126
Autor:
Kitano, Taisuke, Eguchi, Ryota, Okamatsu-Ogura, Yuko, Yamaguchi, Soichiro, Otsuguro, Ken-ichi
Publikováno v:
In Journal of Pharmacological Sciences March 2021 145(3):228-240
Publikováno v:
In Journal of Pharmacological Sciences February 2019 139(2):98-104
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.
Publikováno v:
In Journal of Pharmacological Sciences May 2015 128(1):47-53
Autor:
Shibata, Masahiro, Kitamura, Naoki, Eguchi, Ryota, Sudo, Yuichi, Nakamura, Junya, Kim, Yonghwan
In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic tori. The partial gathering problem is a generalization of the (well-investigated) total gathering problem, which requires that all k agents distributed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30b1c0b2f0c2ac3b51c62d57a2d6497d