R. Das and D. L. Whitley, " The only challenging problems are deceptive ". Proceedings of the Fourth International Conference of Genetic Algorithms. San Mateo, CA: Morgan Kaufman. 116-173, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Signal-to-noise Framework for Quantifying Search Difficulties.. - Kargupta (1994) (Correct)
....the solution space do not provide any information about the right direction, detection of signal for the optimal peak needs more exhaustive sampling. Some examples of such functions can be found in [8] 16] 24 Deceptive problems were first introduced in [18] and later elaborated by many such as [6][32] Deceptive problems pose a signal detection problem to GA. Apart from that, the overall noise sharply reduces soon after the initial stage of a crossover dominant GA. Therefore if the initial population size is not large enough, a wrong signal and low noise is most likely to lead a GA to a ....
R. Das and D. L. Whitley, " The only challenging problems are deceptive ". Proceedings of the Fourth International Conference of Genetic Algorithms. San Mateo, CA: Morgan Kaufman. 116-173, 1991.
Deception Considered Harmful - Grefenstette (1992) (61 citations) (Correct)
....in terms of the Walsh transformation of the fitness function. Goldberg (1987) introduced the notion of Deception in GAs, and defined a Minimal Deceptive Problem (MDP) Subsequently, Deception has come to be widely regarded as a central feature in the design of problems that are difficult for GAs (Das and Whitley, 1991; Homaifar, Qi and Fost, 1991) Goldberg and his colleagues (Goldberg, Korb, and Deb, 1989) have defined messy GAs (mGAs) specifically to handle Deceptive problems, and consider the use of Deceptive functions as test functions to be critical to understanding the convergence of mGAs, traditional ....
....this is a needle in a haystack function, so we don t expect the GA to solve it on a regular basis. But it does satisfy the commonly used definition of GA easy that follows from the SBBH, so this example provides a counterexample to the claim that only Deceptive problems are challenging for GAs (Das and Whitley, 1991). There has been some recent work that addresses the (static) fitness variance within schemas (Goldberg and Rudnick, 1988; Rudnick and Goldberg, 1991) This is a step in the right direction, but it is unlikely that an analysis of the static fitness variance will be much more helpful than an ....
Das, R. and D. L. Whitley (1991). The only challenging problems are deceptive.
Decision Making In Genetic Algorithms: A Signal-To-Noise.. - Kargupta, Goldberg (1994) (3 citations) (Correct)
No context found.
Das, R. and Whitley, D. L. (1991). The only challenging problems are deceptive. Proceedings of the Fourth International Conference of Genetic Algorithms. San Mateo, CA: Morgan Kaufman. 116-173.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC