Zobrazeno 1 - 10
of 298
pro vyhledávání: '"Inoue, Michiko"'
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
We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist $k$ agents with unique identifiers (IDs) in the network, and $f$ of them are weakly Byzantine agents, which behave a
Externí odkaz:
http://arxiv.org/abs/2205.14937
With the expansion of the semiconductor supply chain, the use of recycled field-programmable gate arrays (FPGAs) has become a serious concern. Several methods for detecting recycled FPGAs by analyzing the ring oscillator (RO) frequencies have been pr
Externí odkaz:
http://arxiv.org/abs/2204.02159
In this paper, we focus on graph class identification problems in the population protocol model. A graph class identification problem aims to decide whether a given communication graph is in the desired class (e.g. whether the given communication gra
Externí odkaz:
http://arxiv.org/abs/2111.05111
Autor:
Shintani, Michihiro, Mian, Riaz-Ul-Haque, Nakamura, Tomoki, Kajiyama, Masuo, Eiki, Makoto, Inoue, Michiko
Wafer-level performance prediction has been attracting attention to reduce measurement costs without compromising test quality in production tests. Although several efficient methods have been proposed, the site-to-site variation, which is often obse
Externí odkaz:
http://arxiv.org/abs/2111.01369
We investigate the terminating grid exploration for autonomous myopic luminous robots. Myopic robots mean that they can observe nodes only within a certain fixed distance, and luminous robots mean that they have light devices that can emit colors. Fi
Externí odkaz:
http://arxiv.org/abs/2102.06006
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular, we consider the problem in the context of \emph{arbitrary} communicati
Externí odkaz:
http://arxiv.org/abs/2011.08366
We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of $k$ agents with unique identifiers (IDs), and $f$ of them are weakly Byzantine agents, which behave arbitrarily ex
Externí odkaz:
http://arxiv.org/abs/2007.08217
Software-hardware co-design solutions for decimal computation can provide several Pareto points to development of embedded systems in terms of hardware cost and performance. This paper demonstrates how to accurately evaluate such co-design solutions
Externí odkaz:
http://arxiv.org/abs/2003.05315