111
TITLE: How far is it from here to there? A distance that is coherent with GP operators
AUTHORS: McDermott, J; O'Reilly, UM; Vanneschi, L; Veeramachaneni, K;
PUBLISHED: 2011, SOURCE: 14th European Conference on Genetic Programming, EuroGP 2011 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 6621 LNCS
INDEXED IN: Scopus CrossRef
IN MY: ORCID
112
TITLE: A comparative study of four parallel and distributed PSO methods  Full Text
AUTHORS: Vanneschi, L; Codecasa, D; Mauri, G;
PUBLISHED: 2011, SOURCE: New Generation Computing, VOLUME: 29, ISSUE: 2
INDEXED IN: Scopus CrossRef
IN MY: ORCID
113
TITLE: The effect of selection from old populations in genetic algorithms
AUTHORS: Castelli, M; Manzoni, L; Vanneschi, L;
PUBLISHED: 2011, SOURCE: 13th Annual Genetic and Evolutionary Computation Conference, GECCO'11 in Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication
INDEXED IN: Scopus CrossRef
IN MY: ORCID
114
TITLE: A method to reuse old populations in genetic algorithms
AUTHORS: Castelli, M; Manzoni, L; Vanneschi, L;
PUBLISHED: 2011, SOURCE: 15th Portuguese Conference on Artificial Intelligence, EPIA 2011 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 7026 LNAI
INDEXED IN: Scopus CrossRef
IN MY: ORCID
115
TITLE: The K landscapes: A tunably difficult benchmark for genetic programming
AUTHORS: Vanneschi, L; Castelli, M; Manzoni, L;
PUBLISHED: 2011, SOURCE: 13th Annual Genetic and Evolutionary Computation Conference, GECCO'11 in Genetic and Evolutionary Computation Conference, GECCO'11
INDEXED IN: Scopus
IN MY: ORCID
116
TITLE: Multi objective genetic programming for feature construction in classification problems
AUTHORS: Castelli, M; Manzoni, L; Vanneschi, L;
PUBLISHED: 2011, SOURCE: 5th International Conference on Learning and Intelligent Optimization, LION 2011 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 6683 LNCS
INDEXED IN: Scopus CrossRef
IN MY: ORCID
117
TITLE: The K landscapes. a tunably difficult benchmark for genetic programming
AUTHORS: Leonardo Vanneschi; Mauro Castelli; Luca Manzoni;
PUBLISHED: 2011, SOURCE: Proceedings of the 13th annual conference on Genetic and evolutionary computation - GECCO '11
INDEXED IN: CrossRef
IN MY: ORCID
118
TITLE: A Quantitative Study of Learning and Generalization in Genetic Programming
AUTHORS: Mauro Castelli; Luca Manzoni; Sara Silva; Leonardo Vanneschi;
PUBLISHED: 2011, SOURCE: 14th European Conference on Genetic Programming in GENETIC PROGRAMMING, VOLUME: 6621
INDEXED IN: WOS
119
TITLE: An Empirical Study of Functional Complexity as an Indicator of Overfitting in Genetic Programming
AUTHORS: Leonardo Trujillo; Sara Silva; Pierrick Legrand; Leonardo Vanneschi;
PUBLISHED: 2011, SOURCE: 14th European Conference on Genetic Programming in GENETIC PROGRAMMING, VOLUME: 6621
INDEXED IN: WOS
120
TITLE: THE IMPORTANCE OF BEING FLAT - STUDYING THE PROGRAM LENGTH DISTRIBUTIONS OF OPERATOR EQUALISATION
AUTHORS: Sara Silva; Leonardo Vanneschi;
PUBLISHED: 2011, SOURCE: 9th Workshop on Genetic Programming, Theory and Practice in GENETIC PROGRAMMING THEORY AND PRACTICE IX
INDEXED IN: WOS
Página 12 de 19. Total de resultados: 186.