Sciweavers

7 search results - page 1 / 2
» On the stationary distribution of GAs with fixed crossover p...
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
13 years 10 months ago
On the stationary distribution of GAs with fixed crossover probability
We analyse the convergence of a GA when the mutation probability is low and the selection pressure is high, for arbitrary crossover types and probabilities. We succeed in mathemat...
U. Chandimal de Silva, Joe Suzuki
GECCO
2005
Springer
207views Optimization» more  GECCO 2005»
13 years 10 months ago
Adaptive crossover and mutation in genetic algorithms based on clustering technique
Instead of having fixed px and pm, this paper presents the use of fuzzy logic to adaptively tune px and pm for optimization of power electronic circuits throughout the process. By...
Jun Zhang, Henry Shu-Hung Chung, Jinghui Zhong
FOGA
1998
13 years 5 months ago
Understanding Interactions among Genetic Algorithm Parameters
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
Kalyanmoy Deb, Samir Agrawal
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 4 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 4 months ago
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
Sunil Srinivasa, Martin Haenggi