## Abstract The formalism is presented for modelling of a genetic algorithm (GA) with an adjustment of a search space size, which assumes that the environment and the population form a unique system; it establishes a dynamic balance and convergence towards an optimal solution. The paper describes t
A changing range genetic algorithm
โ Scribed by Adil Amirjanov
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 147 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0029-5981
- DOI
- 10.1002/nme.1175
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Genetic algorithms (GA) have been widely used to solve planning problems. However, they require one to determine the optimal values of many genetic parameters, such as population sizes, crossover probability, mutation probability, and so on. To make matters worse, the most suitable combination of pa
We have developed a novel, fully automatic method for aligning the three-dimensional structures of two proteins. The basic approach is to first align the proteins' secondary structure elements and then extend the alignment to include any equivalent residues found in loops or turns. The initial secon