Justinian P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Genetic Programming Bloat without Semantics - Langdon, Banzhaf (2000) (4 citations) (Correct)
.... GP populations tend to rapidly increase in size as the population evolves [13, 1, 33, 4, 26, 16, 32, 24] If unchecked, this consumes excessive machine resources and so is usually addressed either by enforcing a size or depth limit on the programs or by an explicit size component in the GP fitness [13, 12, 34, 29] although other techniques have been proposed [30, 6, 32, 31, 18] Depth or size limits [9, 20] and simple parsimony pressure [32] may have unexpected and untoward effects, while [11] shows that addition of duplicated code segments (i.e. addition of ineffective code, code that has no impact on the ....
J. P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza et. al., editors, Genetic Programming 1997, pp. 286--294. Morgan Kaufmann.
PPSN VI, Sixth International Conference on Parallel.. - Schoenauer Editor Paris (2000) (Correct)
.... GP populations tend to rapidly increase in size as the population evolves [13, 1, 33, 4, 26, 16, 32, 24] If unchecked, this consumes excessive machine resources and so is usually addressed either by enforcing a size or depth limit on the programs or by an explicit size component in the GP fitness [13, 12, 34, 29] although other techniques have been proposed [30, 6, 32, 31, 18] Depth or size limits [9, 20] and simple parsimony pressure [32] may have unexpected and untoward effects, while [11] shows that addition of duplicated code segments (i.e. addition of ineffective code, code that has no impact on the ....
J. P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza et. al., editors, Genetic Programming 1997, pp. 286--294. Morgan Kaufmann.
Size Fair and Homologous Tree Crossovers for Tree Genetic.. - Langdon (2000) (1 citation) (Correct)
.... 4, 30, 27, 25, 2, 41, 29] If unchecked this consumes excessive machine resources and so is usually addressed either by enforcing a size or depth limit on the programs or by an explicit size component in the GP tness measure which penalises larger programs, although other techniques may be used [13, 12, 42, 3, 36, 32, 39, 10]. Both main approaches have problems [13, 30, 38] 9, 20] Recently there has been increased interest in the underlying causes of bloat [28, 38, 26] It has been shown that the protective e ect of inviable code (which does not e ect the tness of the program) 27, 4] is not sucient to explain ....
Justinian P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
Program Evolution with Explicit Learning: a New.. - Shan, McKay, Abbass.. (2003) (Correct)
....1921 1955 and significantly outperforms GP on the testing data 1956 1979. Actually the best individual found by PEEL generalizes much better on the data set 1956 1979 than any other method cited in [12] Much research has been done on parsimony pressure and control of individual complexity in GP [6, 19, 10, 25]. It is notable that, in our work, although no complicated parsimony mechanism is used, the results 12 still maintained impressively low complexity, furthermore obviously pre mature convergence was not observed. Although more accurate models of predicating sunspots have been obtained by GP [16] ....
J. P. Rosca. Analysis of complexity drift in genetic programming. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286--294, Stanford University, CA, USA, 13-16 1997. Morgan Kaufmann.
Hyperschema Theory for GP with One-Point Crossover, Building.. - Poli (2000) (Correct)
....a known probability whether re(H, t 1) rather than Elm(H, t 1) is going to be above a given threshold. I Introduction Since John Holland s seminal work in the mid seventies and his well known schema theorem [1, 2] schemata are traditionally used to explain why GAs and more recently GP [3, 4, 5] work. Schemata are similarity templates representing entire groups of points in the search space. The schema theorem describes how schemata are expected to propagate generation after generation under the effects of selection, crossover and mutation. The usefulness of the schema theorem has been ....
....a schema can be present multiple times within the same program. This, together with the variability of the size and shape of the programs matching the same schema, leads to considerable complications in the calculations necessary to formulate schema theorems for GP. In more recent definitions [3, 5] schemata are represented by rooted trees or tree fragments. These definitions make schema theorem calculations easier. We describe these schema definitions below. This is a slightly different version of Holland s original theorem which applies when crossover is performed taking both parents ....
[Article contains additional citation context not shown here]
J.P. Rosca, "Analysis of complexity drift in genetic programming," in Genetic Programming 1997.
Genetic Programming and Evolvable Machines, 1, 95-119 (2000) - Size Fair And (Correct)
No context found.
Justinian P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
PPSN VI, Sixth International Conference on Parallel.. - Schoenauer Editor Paris (2000) (Correct)
No context found.
J. P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza et. al., editors, Genetic Programming 1997, pp. 286--294. Morgan Kaufmann.
Exact GP Schema Theory for Headless Chicken Crossover and.. - Riccardo Poli School (2001) (Correct)
No context found.
J. P. Rosca. Analysis of complexity drift in genetic programming. In Genetic Programming 1997.
General Schema Theory for - Genetic Programming With (2003) (Correct)
No context found.
Rosca, J. P. (1997). Analysis of complexity drift in genetic programming. In Koza, J. R., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M., Iba, H., and Riolo, R. L., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-- 294, Stanford University, CA, USA. Morgan Kaufmann.
The Evolution of Size and Shape - Langdon, Soule, Poli, Foster (1999) (11 citations) (Correct)
No context found.
Rosca, J. P. (1997), "Analysis of complexity drift in genetic programming," in Genetic Programming 1997: Proceedings of the Second Annual Conference, J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo (Eds.), pp 286--294, Stanford University, CA, USA: Morgan Kaufmann.
Exact Schema Theorem and Effective Fitness for GP with.. - School Of Computer (2000) (Correct)
No context found.
J. P. Rosca, "Analysis of complexity drift in genetic programming, " in Genetic Programming 1997.
Exact Schema Theorems for GP with One-Point and Standard.. - Riccardo Poli And (2001) (1 citation) (Correct)
No context found.
J. P. Rosca. Analysis of complexity drift in genetic programming. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997.
Markov Chain Models for GP and Variable-length GAs with.. - The University Of (2001) (Correct)
No context found.
Justinian P. Rosca, "Analysis of complexity drift in genetic programming", in Genetic Programming 1997.
Appeared in the Proceedings of Genetic Programming'98.. - Analysis Of Schema (1998) (Correct)
No context found.
Rosca, J. P. (1997). Analysis of complexity drift in genetic programming. In Koza, J. R., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M., Iba, H., and Riolo, R. L., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286--294, Stanford University, CA, USA. Morgan Kaufmann.
Why the Schema Theorem is Correct also in the Presence of.. - Riccardo Poli School (2000) (Correct)
No context found.
Rosca, Justinian P. (1997). Analysis of complexity drift in genetic programming. In: Genetic Programming 1997: Proceedings of the Second Annual Conference (John R.
Exact Schema Theory for GP and Variable-length GAs - With Homologous Crossover (2001) (Correct)
No context found.
J. P. Rosca, "Analysis of complexity drift in genetic programming, " in Genetic Programming 1997.
PPSN VI, Sixth International Conference on Parallel.. - Schoenauer Editor Paris (2000) (Correct)
No context found.
J. P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza et. al., editors, Genetic Programming 1997, pp. 286--294. Morgan Kaufmann.
An Analysis of Diversity in Genetic Programming - Gustafson (2004) (Correct)
No context found.
Rosca, J. (1997a). Analysis of complexity drift in genetic programming. In Koza, J. et al., editors, Proceedings of the Second Annual Genetic Programming Conference, pages 286--294, Stanford University, CA. Morgan Kaufmann.
Problem Difficulty and Code Growth in Genetic Programming - Gustafson, Ekart, Al. (2004) (Correct)
No context found.
J. Rosca, "Analysis of complexity drift in genetic programming," in Genetic Programming 1997: Proceedings of the Second Annual Conference, J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo (Eds.), Morgan Kaufmann: Stanford University, CA, July 1997, pp. 286--294,
Genetic Programming and Evolvable Machines, 1, 95-119 (2000) - Size Fair And (Correct)
No context found.
Justinian P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
The Evolution of Size and Shape - Langdon, Soule, Poli, Foster (1999) (11 citations) (Correct)
No context found.
Rosca, J. P. (1997), "Analysis of complexity drift in genetic programming," in Genetic Programming 1997: Proceedings of the Second Annual Conference, J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo (Eds.), pp 286--294, Stanford University, CA, USA: Morgan Kaufmann.
Sub-Symbolic Representation and Search Operators for Genetic.. - Page (1999) (Correct)
No context found.
J. P. Rosca. Analysis of complexity drift in genetic programming. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997.
The Evolution of Agents - Qureshi (2001) (Correct)
No context found.
Justinian P. Rosca. Analysis of complexity drift in genetic programming. In John R. Koza, Kalyanmoy Deb, Marco Dorigo, David B. Fogel, Max Garzon, Hitoshi Iba, and Rick L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286--294, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
Problem Difficulty and Code Growth in Genetic Programming - Gustafson, Ekart, Burke.. (2004) (Correct)
No context found.
Rosca, J.: 1997, `Analysis of complexity drift in genetic programming'. In: J. Koza et al. (eds.): Proceedings of the Second Annual Genetic Programming Conference. Stanford University, CA, pp. 286-294.
Parameter Control in Evolutionary Algorithms - Eiben, Hinterding, Michalewicz (1999) (21 citations) (Correct)
No context found.
J.P. Rosca. Analysis of complexity drift in genetic programming. In Koza et al. [80], pages 286--294.
First 50 documents Next 50
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