|
Intelligent systems. Theory and applications, 2021, Volume 25, Issue 5, Pages 27–43
(Mi ista324)
|
|
|
|
The one-dimensional closest neighbor search problem solution using the cellular automata with locators
D. I. Vasilev Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Chair of Mathematical Theory of Intelligent Systems
Abstract:
The paper considers applying the locator cellular automaton model to the closest neighbour search problem. The locator cellular automaton model assumes the possibility for each cell to translate a signal through any distance using ether. It is proven in this paper that such possibility allows to decrease the problem complexity from linear to logarithmic (against the classic cellular automaton model).
Keywords:
cellular automaton, homogeneous structures, the closest neighbour search problem.
Citation:
D. I. Vasilev, “The one-dimensional closest neighbor search problem solution using the cellular automata with locators”, Intelligent systems. Theory and applications, 25:5 (2021), 27–43
Linking options:
https://www.mathnet.ru/eng/ista324 https://www.mathnet.ru/eng/ista/v25/i5/p27
|
Statistics & downloads: |
Abstract page: | 50 | Full-text PDF : | 18 | References: | 17 |
|