When to use bit-wise neutrality

DOI10.1007/s11047-008-9106-8zbMath1215.68213OpenAlexW2150465208WikidataQ42017467 ScholiaQ42017467MaRDI QIDQ968377

Frank Neumann, Tobias Friedrich

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

zbMATH Keywords

representationsevolutionary algorithmstheoryneutralityrunning time analysis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Runtime analysis of ant colony optimization with best-so-far reinforcement
• Neutrality and self-adaptation
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
• Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
• On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: When to use bit-wise neutrality