Runtime analysis of mutation-based geometric semantic genetic programming on Boolean functions

DOI10.1145/2460239.2460251MaRDI QIDQ5276120zbMATH OpenOpenAlexFDO

Authors Alberto Moraglio, Andrea Mambrini, Luca Manzoni

Publication date 14 July 2017

Published in Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10871/20899

zbMATH Keywords

Boolean functionsgenetic programminggeometric crossoverruntime analysissemantics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Geometric semantic grammatical evolution
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
• An Introduction to Geometric Semantic Genetic Programming
• The Max problem revisited: the importance of mutation in genetic programming
• On the runtime analysis of the simple genetic algorithm

Cited in

(6)

• Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
• The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
• An Introduction to Geometric Semantic Genetic Programming
• Generation of mutants for boolean expression
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
• Geometric semantic grammatical evolution

This page was built for publication: Runtime analysis of mutation-based geometric semantic genetic programming on Boolean functions

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