Evolving graphs with semantic neutral drift

DOI10.1007/s11047-019-09772-4zbMath1530.68239arXiv1810.10453OpenAlexW2982422689WikidataQ126860972 ScholiaQ126860972MaRDI QIDQ6095481

Susan Stepney, Detlef Plump, Timothy Atkinson

Publication date: 8 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.10453

zbMATH Keywords

genetic programmingevolutionary algorithmssemantic equivalencemutation operatorsneutral driftgraph programming

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• A study of the neutrality of Boolean function landscapes in genetic programming
• From imperative to rule-based graph programs
• Cartesian genetic programming.
• Probabilistic graph programs for randomised and evolutionary algorithms
• A review on evolutionary algorithms in Bayesian network learning and inference tasks
• 10.1162/153244302760200696
• Interacting quantum observables: categorical algebra and diagrammatics
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• Unnamed Item
• Unnamed Item
• Unnamed Item