ACRI
2004
Springer
13 years 10 months ago
2004
Springer
Cellular automata (CA) are highly parallel and discrete dynamical systems, whose behavior is completely specified in terms of a local relation. They were successfully applied for s...
UC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
ACRI
2006
Springer
13 years 10 months ago
2006
Springer
Cellular automata are discrete dynamical systems that are widely used to model natural systems. Classically they are run with perfect synchrony ; i.e., the local rule is applied to...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...