When to use bit-wise neutrality
type: Item
instance of: scholarly article
title: When to use bit-wise neutrality
zbMATH Open document ID: 1215.68213
author: Tobias Friedrich
author: F. Neumann
published in: Natural Computing
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5703923
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: neutrality
zbMATH Keywords: representations
zbMATH Keywords: running time analysis
zbMATH Keywords: theory
MaRDI profile type: Publication
full work available at URL: s11047-008-9106-8
OpenAlex ID: W2150465208
Wikidata QID: Q42017467
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Runtime analysis of ant colony optimization with best-so-far reinforcement
cites work: Drift analysis and average time complexity of evolutionary algorithms
cites work: Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
cites work: On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness
cites work: Q4449708
cites work: Neutrality and self-adaptation
cites work: On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
cites work: Burden and benefits of redundancy
DBLP publication ID: journals/nc/FriedrichN10
DOI: 10.1007/S11047-008-9106-8
description: scientific article; zbMATH DE number 5703923