Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and sepa...
Nguyen Xuan Hoai, Robert I. McKay, Daryl Essam, Hu...
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone, ...
In order to overcome the low convergence speed and prematurity of classical genetic algorithm, an improved method named directional self-learning of genetic algorithm (DSLGA) is p...
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...