Weighted Mutation of Connections To Mitigate Search Space Limitations in Cartesian Genetic Programming

DOI10.1145/3594805.3607130MaRDI QIDQ6202156zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 23 February 2024

Published in Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3594805.3607130

zbMATH Keywords

Cartesian genetic programmingCGPevolutionary algorithmgenetic programmingmutation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• Cartesian genetic programming.
• Complexity Theory
• scientific article; zbMATH DE number 1700035 (Why is no real title available?)
• scientific article; zbMATH DE number 2087177 (Why is no real title available?)

This page was built for publication: Weighted Mutation of Connections To Mitigate Search Space Limitations in Cartesian Genetic Programming

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