Two Remarkable Computational Competencies of the Simple Genetic Algorithm

Details Two Remarkable Computational Competencies of the Simple Genetic Algorithm Two Remarkable Computational Competencies of the Simple Genetic Algorithm

2008-10-19

arxiv.org/abs/0810.3357v2

Computer Science

Neural and Evolutionary Computing

Sharpened motivation, improved notation

Scientific paper

Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we distinguish between a computational competency of the SGA--an efficient, but narrow computational ability--and a computational proficiency of the SGA--a computational ability that is both efficient and broad. Till date, attempts to deduce a computational proficiency of the SGA have been unsuccessful. It may, however, be possible to inductively infer a computational proficiency of the SGA from a set of related computational competencies that have been deduced. With this in mind we deduce two computational competencies of the SGA. These competencies, when considered together, point toward a remarkable computational proficiency of the SGA. This proficiency is pertinent to a general problem that is closely related to a well-known statistical problem at the cutting edge of computational genetics.

Affiliated with

Also associated with

No associations

Rating

Two Remarkable Computational Competencies of the Simple Genetic Algorithm 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 Two Remarkable Computational Competencies of the Simple Genetic Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Remarkable Computational Competencies of the Simple Genetic Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232090