When to use bit-wise neutrality
Open Access
- 26 October 2008
- journal article
- research article
- Published by Springer Nature in Natural Computing
- Vol. 9 (1) , 283-294
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Runtime Analysis of Ant Colony Optimization with Best-So-Far ReinforcementMethodology and Computing in Applied Probability, 2007
- On the Optimization of Monotone Polynomials by Simple Randomized Search HeuristicsCombinatorics, Probability and Computing, 2005
- On the analysis of the (1+1) evolutionary algorithmTheoretical Computer Science, 2002
- Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitnessIEEE Transactions on Evolutionary Computation, 2001
- Drift analysis and average time complexity of evolutionary algorithmsArtificial Intelligence, 2001
- Burden and Benefits of Redundancy2001
- Rigorous Hitting Times for Binary MutationsEvolutionary Computation, 1999
- Exploring phenotype space through neutral evolutionJournal of Molecular Evolution, 1996
- Smoothness within ruggedness: the role of neutrality in adaptation.Proceedings of the National Academy of Sciences, 1996
- Evolutionary Rate at the Molecular LevelNature, 1968