Computation in artificially evolved, non-uniform cellular automata
From MaRDI portal
Publication:1285794
DOI10.1016/S0304-3975(98)00151-0zbMath0914.68138OpenAlexW2079709873MaRDI QIDQ1285794
Publication date: 28 April 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00151-0
Related Items (5)
EFFICIENCY ANALYSIS OF THE TIME-SHUFFLING METHOD FOR THE EVOLUTION OF AGENT BEHAVIOR ⋮ Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony ⋮ All-to-All Communication with CA Agents by Active Coloring and Acknowledging ⋮ CA Models for Target Searching Agents ⋮ Deducing local rules for solving global tasks with random Boolean networks
Uses Software
Cites Work
- Efficient parallel genetic algorithms: Theory and practice
- Evolving cellular automata to perform computations: Mechanisms and impediments
- Advances in artificial life. Third European conference on artificial life, Granada, Spain, June 4-6, 1995. Proceedings
- Co-evolving non-uniform cellular automata to perform computations
- Co-evolving architectures for cellular machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computation in artificially evolved, non-uniform cellular automata