Performance of the majority voting rule in solving the density classification problem in high dimensions
JM Gomez Soto, H Fukś - Journal of Physics A Mathematical …, 2011 - ui.adsabs.harvard.edu
The density classification problem (DCP) is one of the most widely studied problems in the
theory of cellular automata. After it was shown that the DCP cannot be solved perfectly, the
research in this area has been focused on finding better rules that could solve the DCP
approximately. In this paper, we argue that the majority voting rule in high dimensions can
achieve high performance in solving the DCP, and that its performance increases with
dimension. We support this conjecture with arguments based on the mean-field …
theory of cellular automata. After it was shown that the DCP cannot be solved perfectly, the
research in this area has been focused on finding better rules that could solve the DCP
approximately. In this paper, we argue that the majority voting rule in high dimensions can
achieve high performance in solving the DCP, and that its performance increases with
dimension. We support this conjecture with arguments based on the mean-field …
Performance of the majority voting rule in solving the density classification problem in high dimensions
JMG Soto, H Fukś - Journal of Physics A: Mathematical and …, 2011 - iopscience.iop.org
The density classification problem (DCP) is one of the most widely studied problems in the
theory of cellular automata. After it was shown that the DCP cannot be solved perfectly, the
research in this area has been focused on finding better rules that could solve the DCP
approximately. In this paper, we argue that the majority voting rule in high dimensions can
achieve high performance in solving the DCP, and that its performance increases with
dimension. We support this conjecture with arguments based on the mean-field …
theory of cellular automata. After it was shown that the DCP cannot be solved perfectly, the
research in this area has been focused on finding better rules that could solve the DCP
approximately. In this paper, we argue that the majority voting rule in high dimensions can
achieve high performance in solving the DCP, and that its performance increases with
dimension. We support this conjecture with arguments based on the mean-field …
以上显示的是最相近的搜索结果。 查看全部搜索结果