Efficiency speed-up strategies for evolutionary computation: fundamentals and fast-GAs.

DOI10.1016/S0096-3003(02)00309-0zbMath1069.68092OpenAlexW1967974225MaRDI QIDQ1399745

D. Massart

Publication date: 30 July 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00309-0

zbMATH Keywords

fractal image compressiongenetic algorithmsspace discretizationreinitializationEvolutionary computationcoevolution-like decompositionefficiency speed-upexclusion-based selection operatorrefined cellular partioningspace shrinkingsplicing/decomposable representation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

A novel splicing/decomposable binary encoding and its operators for genetic and evolutionary algorithms ⋮ Evolution strategies with exclusion-based selection operators and a Fourier series auxiliary function ⋮ A mixed strategy of combining evolutionary algorithms with multigrid methods

Cites Work

• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• Towards designing artificial neural networks by evolution
• A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
• Iterated function systems and the global construction of fractals
• Efficiency speed‐up strategies for evolutionary computation: an adaptive implementation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficiency speed-up strategies for evolutionary computation: fundamentals and fast-GAs.