Computer Science – Neural and Evolutionary Computing
Scientific paper
2012-03-28
Computer Science
Neural and Evolutionary Computing
Scientific paper
This paper presents a general analysis of evolutionary algorithms for solving
hard and easy fitness functions. Two results are proven in the paper: (1) using
lower selection pressure is better for solving hard fitness functions; (2) the
strong cut-of point is 1 for solving any easy fitness function, which means it
brings no benefit if using a population size larger than 1.
Chen Tianshi
He Jun
No associations
LandOfFree
A General Analysis of Evolutionary Algorithms for Hard and Easy Fitness Functions 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 A General Analysis of Evolutionary Algorithms for Hard and Easy Fitness Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A General Analysis of Evolutionary Algorithms for Hard and Easy Fitness Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-272943