Deception Considered Harmful* *With apologies to Edsger Dijkstra (Dijkstra, 1968).
- 1 January 1993
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their ExplanationMachine Learning, 1993
- Modeling genetic algorithms with Markov chainsAnnals of Mathematics and Artificial Intelligence, 1992
- Deception, dominance and implicit parallelism in genetic searchAnnals of Mathematics and Artificial Intelligence, 1992
- Construction of high-order deceptive functions using low-order Walsh coefficientsAnnals of Mathematics and Artificial Intelligence, 1992
- An Analysis of Multi-Point CrossoverPublished by Elsevier ,1991
- Conditions for Implicit ParallelismPublished by Elsevier ,1991
- Isomorphisms Of Genetic AlgorithmsPublished by Elsevier ,1991
- Fundamental Principles of Deception in Genetic SearchPublished by Elsevier ,1991
- The Nonuniform Walsh-Schema TransformPublished by Elsevier ,1991
- Letters to the editor: go to statement considered harmfulCommunications of the ACM, 1968