Computer Science – Neural and Evolutionary Computing
Scientific paper
2011-04-13
Computer Science
Neural and Evolutionary Computing
14 pages, submitted to ACM GECCO-2011
Scientific paper
This paper explores an idealized dynamic population sizing strategy for solving additive decomposable problems of uniform scale. The method is designed on top of the foundations of existing population sizing theory for this class of problems, and is carefully compared with an optimal fixed population sized genetic algorithm. The resulting strategy should be close to a lower bound in terms of what can be achieved, performance-wise, by self-adjusting population sizing algorithms for this class of problems.
No associations
LandOfFree
Idealized Dynamic Population Sizing for Uniformly Scaled Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Idealized Dynamic Population Sizing for Uniformly Scaled Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Idealized Dynamic Population Sizing for Uniformly Scaled Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-164875