500 search results - page 24 / 100 » Universality and Cellular Automata |
154
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
158
Voted
IJHIS
2006
15 years 3 months ago
2006
In this paper, a new evolutionary computing model, called CLA-EC, is proposed. This model is a combination of a model called cellular learning automata (CLA) and the evolutionary ...
130
Voted
AUSAI
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents two novel features of an emergent data visualization method coined "cellular ants": unsupervised data class labeling and shape negotiation. This metho...
119
Voted
WIA
2004
Springer
15 years 9 months ago
2004
Springer
d abstract) Gaoyan Xie, Cheng Li, and Zhe Dang School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Abstract. In this paper, ...
153
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...