The Only Challenging Problems Are Deceptive: Global Search by Solving Order-1 Hyperplanes
Explore this paper's citation graph
- Type
- article
- Published
- 1991-01-01
- Cited by
- 48
- References
- 0
- OpenAlex
- https://openalex.org/W141541527
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:41492308
Keywords
Hyperplane, Computer science, Order (exchange), Mathematics
References
No references recorded for this paper.
Cited by
- Using coevolution in complex domains
- Independent sampling genetic algorithms
- Comparison of a genetic algorithm and simulated annealing in an application to statistical image reconstruction
- ε - Optimal Stopping Time for Genetic Algorithms
- Combinations of genetic algorithms and neural networks: a survey of the state of the art
- Epistasis in Genetic Algorithms: An Experimental Design Perspective
- The design and analysis of a computational model of cooperative coevolution
- Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
- An improved genetic algorithm for solving deceptive problems
- Tracking primary hyperplane competitors during genetic search
- Modeling genetic algorithms with interacting particle systems
- Epistasis in Genetic Algorithms Revisited
- Rigorous Hitting Times for Binary Mutations
- New topics in Genetic Algorithm research
- An introduction to genetic algorithms
- What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
- A Growing Evolutionary Algorithm and Its Application for Data Mining
- Two Remarkable Computational Competencies of the Simple Genetic Algorithm
- A comparison of predictive measures of problem difficulty in evolutionary algorithms
- On the improvement of coevolutionary optimizers by learning variable interdependencies
Related papers
- Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
- Genetic Algorithms in Search Optimization and Machine Learning
- Simple Genetic Algorithms and the Minimal, Deceptive Problem
- Genetic Algorithms in Search
- Representational issues in genetic optimization
- GA-Easy Does Not Imply Steepest-Ascent Optimizable
- Messy Genetic Algorithms: Motivation, Analysis, and First Results
- Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis