Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Analysis of single-node (building) blocks in genetic programming
Advances in genetic programming
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Genetic Programming and Evolvable Machines
An Empirical Study of Multipopulation Genetic Programming
Genetic Programming and Evolvable Machines
Calculating the expected loss of diversity of selection schemes
Evolutionary Computation
A Mathematical Analysis of Tournament Selection
Proceedings of the 6th International Conference on Genetic Algorithms
Advanced Population Diversity Measures in Genetic Programming
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
A Survey And Analysis Of Diversity Measures In Genetic Programming
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
What makes a problem GP-hard? validating a hypothesis of structural causes
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Population implosion in genetic programming
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Dynamic maximum tree depth: a simple technique for avoiding bloat in tree-based GP
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Two fast tree-creation algorithms for genetic programming
IEEE Transactions on Evolutionary Computation
Diversity in genetic programming: an analysis of measures and correlation with fitness
IEEE Transactions on Evolutionary Computation
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Characterizing the dynamics of symmetry breaking in genetic programming
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Genetic programming: profiling reasonable parameter value windows with varying problem difficulty
International Journal of Innovative Computing and Applications
Behavioural Diversity and Filtering in GP Navigation Problems
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Information distance based fitness and diversity metrics
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Phenotypic diversity in initial genetic programming populations
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
| Hi-index | 0.00 |
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influencing problem difficulty are changed. The results corroborate both theoretical and empirical studies on factors that influence population dynamics. The results also indicate a clue for a possible empirical measurement that could be used in tuning initial populations for increasing the likelihood of success.