William M. Spears, "Aggregating models of evolutionary algorithms", in Proceedings of the Congress on Evolutionary Computation, Peter J. Angeline, Zbyszek Michalewicz, Marc Schoenauer, Xin Yao, and Ali Zalzala, Eds., Mayflower Hotel, Washington D.C., USA, 6-9 July 1999, vol. 1, pp. 631--638, IEEE Press. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Towards computing the parameters of the Simple Genetic Algorithm - Jonsson, Malec (Correct)
....unmanageable. For example, let us consider L = 5, a binary alphabet and U = 10. Then, from the equation B = tr v ] which calculates the V l dimension of Q) we get B 10 . This indicates that it is computationally unmanageable (even af ter applying an aggregation method suggested by Spears in [8]) to calculate all elements of Q for any real world problems. Our future work will include explicit solving the maximisation problem for small populations and chromosome lengths. The framework will also be extended with the formal analysis of continuous and limit behaviour of the transitions ....
W. M. Spears. Aggregating models of evolutionary algorithms. In Congress on Evolutionary Computation, pages 631-638, 1999.
Exact Schema Theory for Genetic Programming and Variable-length.. - Poli (2001) (Correct)
....theorems one can specialise the schema equations to schemata of di erent order, and, therefore, one can vary the level of coarse graining. Other examples of models in which both the predicted and the predicting quantities present the same level of coarse graining are exact [45] and approximate [50] Markov models in which some of the states of the system have been aggregated. These are represented by the large blob located half way between Vose s and the statistical mechanics spheres in Figure 1. The use of macroscopic quantities in the r.h.s. of GA models tends to lead to simpler equations ....
W. M. Spears. Aggregating models of evolutionary algorithms. In P. J. Angeline, Z. Michalewicz, M. Schoenauer, X. Yao, and A. Zalzala, editors, Proceedings of the Congress on Evolutionary Computation, volume 1, pages 631-638, May ower Hotel, Washington D.C., USA, IEEE Press: Piscataway, NJ, 6-9 July 1999.
Towards computing the parameters of the Simple Genetic Algorithm - Jonsson, Malec (2001) (Correct)
....For example, let us consider L = 5, a binary alphabet and U = 10. Then, from the equation B = U V 1 V 1 (which calculates the dimension of Q) we get B 10 9 . This indicates that it is computationally unmanageable (even after applying an aggregation method suggested by Spears in [8]) to calculate all elements of Q for any real world problems. Our future work will include explicit solving the maximisation problem for small populations and chromosome lengths. The framework will also be extended with the formal analysis of continuous and limit behaviour of the transitions de ....
W. M. Spears. Aggregating models of evolutionary algorithms. In Congress on Evolutionary Computation, pages 631-638, 1999.
Markov Models for GP and Variable-length GAs with Homologous.. - Poli, Rowe, al. (2001) (Correct)
.... 1975, Radcliffe 1997) the interest of GA theorists has shifted in the last decade towards microscopic Markov models, such as Vose s model, possibly with aggregated states (Nix and Vose 1992, Vose 1999, Davis and Principe 1993, Rudolph 1997c, Rudolph 1997a, Rudolph 1994, Rudolph 1997b, Rowe 1999, Spears 1999). 1 In the last year or so the theory of schemata has made considerable progress, both for GAs and GP. This includes several new schema theorems which give exact formulations (rather than the lower bounds previously presented in the literature (Koza 1992, Altenberg 1994, O Reilly and Oppacher ....
Spears, William M. (1999). Aggregating models of evolutionary algorithms. In: Proceedings of the Congress on Evolutionary Computation (Peter J. Angeline, Zbyszek Michalewicz, Marc Schoenauer, Xin Yao and Ali Zalzala, Eds.). Vol. 1. IEEE Press. Mayflower Hotel, Washington D.C., USA. pp. 631--638.
Markov Chain Models for GP and Variable-length GAs with.. - The University Of (2001) (Correct)
No context found.
William M. Spears, "Aggregating models of evolutionary algorithms", in Proceedings of the Congress on Evolutionary Computation, Peter J. Angeline, Zbyszek Michalewicz, Marc Schoenauer, Xin Yao, and Ali Zalzala, Eds., Mayflower Hotel, Washington D.C., USA, 6-9 July 1999, vol. 1, pp. 631--638, IEEE Press.
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