Fogel D.B., An Introduction to Evolutionary Computation, Tutorial, Congress on Evolutionary Computation CEC2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Evolutionary Computation as a Multi-Agent Search: a $-Calculus.. - Eberbach (2001) (Correct)
.... of the best individual from the beam population) if complete and elitist strategies are used (best individuals preserved) It is interesting that the formal proofs of Theorems 4 and 5 have been scattered through evolutionary computation literature, although most important elements can be found in [14, 10], However, the current formulation of the theorems in the context of bounded rationality, is due to the author of this paper. Theorem 6 (on total optimality of evolutionary computation) Evolutionary computation is not totally optimal, i.e. computationally very expensive, as the result of ....
Fogel D., Introduction to Evolutionary Computation, Tutorial, Congress on Evolutionary Computation CEC'
The Role of Completeness in Convergence of - Evolutionary Algorithms Eugene (Correct)
No context found.
Fogel D.B., An Introduction to Evolutionary Computation, Tutorial, Congress on Evolutionary Computation CEC2001.
BioSystems 82 (2005) 1--19 - Toward Theory Of (Correct)
No context found.
Fogel, D.B., 2001. An Introduction to Evolutionary Computation, Tutorial, Congress on Evolutionary Computation (CEC'2001), Seoul, Korea.
Evolving Neural Network Architecture and Weights - Using An Evolutionary (Correct)
No context found.
David B. Fogel. An introduction to evolutionary computation. In Evolutionary Computation: the fossil record, pages 1--2. IEEE Press, 1998.
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