This article is cited in 6 papers

Part 3. Mathematical models

The closest neighbour problem solution using the cellular automata with locators model

D. I. Vasilyev

KORUS Consulting LLC

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 automata, homogeneous structures, the closest neighbour search problem.