Two Remarkable Computational Competencies of the Simple Genetic Algorithm

Simple item page
dc.creatorBurjorjee, Keki M.
dc.date2008-10-19
dc.date2009-03-31
dc.date.accessioned2026-07-07T12:58:21Z
dc.date.available2026-07-07T12:58:21Z
dc.descriptionSince 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.
dc.descriptionSharpened motivation, improved notation
dc.identifierhttps://arxiv.org/abs/0810.3357
dc.identifierhttp://arxiv.org/abs/0810.3357
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225216
dc.subjectNeural and Evolutionary Computing
dc.subjectI.2.8; F.2.m
dc.titleTwo Remarkable Computational Competencies of the Simple Genetic Algorithm
dc.typetext

Files

Collections

arXiv