Limiting Distribution and Mixing Time for Genetic Algorithms

2017 ◽  
pp. 95-122
Author(s):  
S. Alwadani ◽  
F. Mendivil ◽  
R. Shonkwiler
Keyword(s):  
Genetic Algorithms ◽  
Mixing Time ◽  
Limiting Distribution

scholarly journals Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging

10.37236/133 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Pu Gao ◽  
Nicholas Wormald
Keyword(s):  
Rate Of Convergence ◽  
Total Variation ◽  
Upper Bound ◽  
Mixing Time ◽  
Limiting Distribution ◽  
Total Variation Distance ◽  
Regular Graphs ◽  
Short Cycle ◽  
Variation Distance

The pegging algorithm is a method of generating large random regular graphs beginning with small ones. The $\epsilon$-mixing time of the distribution of short cycle counts of these random regular graphs is the time at which the distribution reaches and maintains total variation distance at most $\epsilon$ from its limiting distribution. We show that this $\epsilon$-mixing time is not $o(\epsilon^{-1})$. This demonstrates that the upper bound $O(\epsilon^{-1})$ proved recently by the authors is essentially tight.

Genetic Algorithms—a Tool for OR?

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

Enhanced Artificial Intelligent Method for Representing the Photonic Crystal Fiber Profile Index

2018 ◽  
Vol 1 (1) ◽  
pp. 2-19
Author(s):  
Mahmood Sh. Majeed ◽  
Raid W. Daoud
Keyword(s):  
Genetic Algorithms ◽  
Photonic Crystal ◽  
Photonic Crystal Fiber ◽  
New Method ◽  
Proper Solution ◽  
Artificial Intelligent ◽  
Crystal Fiber ◽  
Fitness Value ◽  
First Pass ◽  
Crossover And Mutation

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).

Optimizing Time-multiplexing Raster Cellular Neural Network simulator using genetic algorithms with RK8(6)

2011 ◽  
Vol 3 (6) ◽  
pp. 87-90
Author(s):  
O. H. Abdelwahed O. H. Abdelwahed ◽  
◽  
M. El-Sayed Wahed ◽  
O. Mohamed Eldaken
Keyword(s):  
Neural Network ◽  
Genetic Algorithms ◽  
Cellular Neural Network ◽  
Network Simulator

Optimization of Linear Equations using Genetic Algorithms

2011 ◽  
Vol 2 (3) ◽  
pp. 56-58
Author(s):  
Roshni .V Patel ◽  
◽  
Jignesh. S Patel
Keyword(s):  
Genetic Algorithms ◽  
Linear Equations
Sign in / Sign up

Export Citation Format

Share Document