𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Genetic algorithms for generation of class boundaries

✍ Scribed by Pal, S.K.; Bandyopadhyay, S.; Murthy, C.A.

Book ID
117874449
Publisher
IEEE
Year
1998
Tongue
English
Weight
392 KB
Volume
28
Category
Article
ISSN
1083-4419

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A genetic algorithm for generating grain
A genetic algorithm for generating grain boundaries
✍ SebastiΓ‘n Echeverri, Restrepo; Giraldo, SimΓ³n Tamayo; Thijsse, Barend J πŸ“‚ Article πŸ“… 2013 πŸ› Institute of Physics 🌐 English βš– 900 KB
Orderly algorithms for generating restri
Orderly algorithms for generating restricted classes of graphs
✍ Charles J. Colbourn; Ronald C. Read πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 463 KB

## Abstract Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of

A class of genetic algorithms with analy
A class of genetic algorithms with analytical solution
✍ Erol Gelenbe πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 419 KB

We study a class of genetic algorithms (GAs) based on a population of chromosomes with mutation and crossover, as well as fitness. The chromosomes in these algorithms also have another property we call "activity" (which determines how fast a chromosome may mutate or interact with other chromosomes).