When to use bit-wise neutrality
DOI10.1007/S11047-008-9106-8zbMATH Open1215.68213DBLPjournals/nc/FriedrichN10OpenAlexW2150465208WikidataQ42017467 ScholiaQ42017467MaRDI QIDQ968377FDOQ968377
Authors: Tobias Friedrich, F. Neumann 
Publication date: 5 May 2010
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-008-9106-8
Recommendations
- On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness
- Neutrality and self-adaptation
- scientific article; zbMATH DE number 1700035
- New insights on neutral binary representations for evolutionary optimization
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Drift analysis and average time complexity of evolutionary algorithms
- On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness
- Burden and benefits of redundancy
- Runtime analysis of ant colony optimization with best-so-far reinforcement
- On the analysis of the \((1+1)\) evolutionary algorithm
- On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
- Neutrality and self-adaptation
- Title not available (Why is that?)
- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
Cited In (3)
This page was built for publication: When to use bit-wise neutrality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968377)
