Sciweavers

139 search results - page 5 / 28
» How Common Can Be Universality for Cellular Automata
Sort
View
ACRI
2004
Springer
14 years 1 months ago
Evolving Transition Rules for Multi Dimensional Cellular Automata
Abstract. Genetic Algorithms have been used before to evolve transition rules for one dimensional Cellular Automata (CA) to solve e.g. the majority problem and investigate communic...
Ron Breukelaar, Thomas Bäck
IPPS
2000
IEEE
14 years 6 days ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
ISMB
1993
13 years 9 months ago
Minimizing Complexity in Cellular Automata Models of Self-Replication
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...
AC
1998
Springer
13 years 7 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn
IJON
2006
127views more  IJON 2006»
13 years 7 months ago
Evolved neural networks based on cellular automata for sensory-motor controller
Constructing the controller of a mobile robot has several issues to be addressed: how to automate behavior generation procedure, how to insert available domain knowledge effective...
Kyung-Joong Kim, Sung-Bae Cho