Selection intensity in asynchronous cellular evolutionary algorithms

DOI10.1007/3-540-45105-6_107MaRDI QIDQ4436922zbMATH OpenFDO

Authors Mario Giacobini, Enrique Alba, Marco Tomassini

Publication date 4 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2723/27230955.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Artificial Evolution
• Artificially evolved asynchronous cellular automata for the density task
• Evolving robust asynchronous cellular automata for the density task
• What do we mean by asynchronous CA? A reflection on types and effects of asynchronicity
• Cellular Evolutionary Algorithms

Cited in

(3)

• Understanding Simple Asynchronous Evolutionary Algorithms
• Artificial Evolution
• A study on meme propagation in multimemetic algorithms

This page was built for publication: Selection intensity in asynchronous cellular evolutionary algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436922)