Compact representations as a search strategy: compression EDAs
From MaRDI portal
Publication:2503341
Recommendations
- Foundations of Genetic Algorithms
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
- scientific article; zbMATH DE number 2040664
- scientific article; zbMATH DE number 1664953
Cites work
- A survey of optimization by building and using probabilistic models
- scientific article; zbMATH DE number 1149447 (Why is no real title available?)
- scientific article; zbMATH DE number 2013448 (Why is no real title available?)
- scientific article; zbMATH DE number 2040650 (Why is no real title available?)
- scientific article; zbMATH DE number 2040664 (Why is no real title available?)
- scientific article; zbMATH DE number 1862355 (Why is no real title available?)
- scientific article; zbMATH DE number 2119662 (Why is no real title available?)
- Information geometry on hierarchy of probability distributions
- Minimum description length induction, Bayesianism, and Kolmogorov complexity
- The minimum description length principle in coding and modeling
Cited in
(3)
This page was built for publication: Compact representations as a search strategy: compression EDAs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503341)