Comparing evolutionary computation techniques via their representation

DOI10.1007/3-540-45105-6_127MaRDI QIDQ4436947zbMATH OpenFDO

Authors Boris S. Mitavskiy

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/27231196.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

• scientific article; zbMATH DE number 1054927
• Heuristic methods for evolutionary computation techniques
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• scientific article; zbMATH DE number 1100792
• New insights on neutral binary representations for evolutionary optimization

Cited in

(8)

• A novel splicing/decomposable binary encoding and its operators for genetic and evolutionary algorithms
• New insights on neutral binary representations for evolutionary optimization
• Harmonic recombination for evolutionary computation
• Comparative Investigation of Various Evolutionary and Memetic Algorithms
• Comparison of Various Evolutionary and Memetic Algorithms
• On the locality of representations
• Foundations of Genetic Algorithms
• Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns

This page was built for publication: Comparing evolutionary computation techniques via their representation

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