1993 ◽  
Vol 02 (02) ◽  
pp. 219-234 ◽  
Author(s):  
ROBERT G. REYNOLDS ◽  
JONATHAN I. MALETIC

The Version Space Controlled Genetic Algorithms (VGA) uses the structure of the version space to cache generalizations about the performance history of chromosomes in the genetic algorithm. This cached experience is used to constrain the generation of new members of the genetic algorithms population. The VGA is shown to be a specific instantiation of a more general framework, Autonomous Learning Elements (ALE). The capabilities of the VGA system are demonstrated using the Boole problem suggested by Wilson [Wilson 1987]. The performance of the VGA is compared to that of decision trees and genetic algorithms. The results suggest that the VGA is able to exploit a certain set of symbiotic relationships between its components, so that the resulting system performs better than either component individually.


1996 ◽  
Vol 47 (4) ◽  
pp. 550-561 ◽  
Author(s):  
Kathryn A Dowsland
Keyword(s):  

2018 ◽  
Vol 1 (1) ◽  
pp. 2-19
Author(s):  
Mahmood Sh. Majeed ◽  
Raid W. Daoud

A new method proposed in this paper to compute the fitness in Genetic Algorithms (GAs). In this new method the number of regions, which assigned for the population, divides the time. The fitness computation here differ from the previous methods, by compute it for each portion of the population as first pass, then the second pass begin to compute the fitness for population that lye in the portion which have bigger fitness value. The crossover and mutation and other GAs operator will do its work only for biggest fitness portion of the population. In this method, we can get a suitable and accurate group of proper solution for indexed profile of the photonic crystal fiber (PCF).


2011 ◽  
Vol 3 (6) ◽  
pp. 87-90
Author(s):  
O. H. Abdelwahed O. H. Abdelwahed ◽  
◽  
M. El-Sayed Wahed ◽  
O. Mohamed Eldaken

2011 ◽  
Vol 2 (3) ◽  
pp. 56-58
Author(s):  
Roshni .V Patel ◽  
◽  
Jignesh. S Patel

Sign in / Sign up

Export Citation Format

Share Document