Coevolutionary search for one-dimensional cellular automata, based on parameters related to their dynamic behaviour
item.page.type
Artigo
Date
2003
item.page.ispartof
Journal of Intelligent and Fuzzy Systems
item.page.citationsscopus
0
Authors
Oliveira G.M.B.
Asakura O.K.N.
De Oliveira P.P.B.
Asakura O.K.N.
De Oliveira P.P.B.
publication.page.advisor
Journal Title
Journal ISSN
Volume Title
publication.page.board
publication.page.program
Abstract
The understanding of how cellular automata (CA) carry out arbitrary computations through totally local and parallel processing and how to harness their programmability is still extremely vague. In order to face this question various evolutionary methods have been used to look for cellular automata of a predefined computational behaviour. In this context, the most widely studied CA task is the density classification task (DCT), the best rule currently known for it having been obtained by a coevolutionary genetic algorithm (CGA). Extending our previous success in incorporating a parameter-based heuristic into a standard, single population genetic algorithm in the DCT, here we analyse the influence of incorporating that heuristic into the coevolutionary search. The results obtained show that the parameters can effectively help a CGA in searching for DCT rules, and suggest that the choice of the amount of bias in the search, allowed for the heuristic is more sensitive than in the standard genetic search.
Description
Keywords
item.page.scopussubject
Density classification task (DCT)