𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Genetic search algorithms and their randomized operators

✍ Scribed by S. Arunkumar; T. Chockalingam

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
607 KB
Volume
25
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Genetic algorithms as a combination of p
Genetic algorithms as a combination of probabilistic solution-space decomposition and randomized search
✍ Akiko Aizawa πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 261 KB

In this paper, genetic algorithms are interpreted as a combination of probabilistic solution-space decomposition and randomized search. We study a method for characterization of the solution space from this point of view. Initially, a statistical measure called the variance coefficient is defined as

Adaptive morphological operators, fast a
Adaptive morphological operators, fast algorithms and their applications
✍ F. Cheng; A.N. Venetsanopoulos πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 855 KB

In this paper, adaptive morphological operators are further developed, extending those of Ref. [1], to allow more freedom in forming their operational windows that can adapt their shapes according to the local features of the processed images. The properties of the adaptive operators are investigate

Automatic parameterization of force fiel
Automatic parameterization of force field by systematic search and genetic algorithms
✍ Junmei Wang; Peter A. Kollman πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 142 KB

## Abstract Parmscan is an automatic engine for force‐field parameterization. In this work, we applied both systematic search (SS) and a genetic algorithm (GA) to optimize the force‐field parameters (bond length, bond angle, as well as torsional angle terms) to reproduce the relative energies of co

Analysis and parameter selection for an
Analysis and parameter selection for an adaptive random search algorithm
✍ Rajeeva Kumar; Pierre T. Kabamba; David C. Hyland πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 160 KB

This paper presents an analysis of an adaptive random search (ARS) algorithm, a global minimization method. A probability model is introduced to characterize the statistical properties of the number of iterations required to find an acceptable solution. Moreover, based on this probability model, a n