• Publications
  • Influence
The compact genetic algorithm
TLDR
Introduces the compact genetic algorithm (cGA) which represents the population as a probability distribution over the set of solutions and is operationally equivalent to the order-one behavior of the simple GA with uniform crossover. Expand
  • 961
  • 80
  • PDF
Finding Multimodal Solutions Using Restricted Tournament Selection
  • G. Harik
  • Computer Science
  • ICGA
  • 15 July 1995
TLDR
This paper investigates a new technique for the solving of multimodal problems using genetic algorithms (GAs). Expand
  • 453
  • 56
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms
Learning Gene Linkage to E ciently Solve Problems of Bounded Di culty Using Genetic Algorithms by Georges Raif Harik Co-Chairs: Keki B. Irani and David E. Goldberg The complicated nature of modernExpand
  • 223
  • 32
  • PDF
A parameter-less genetic algorithm
TLDR
We propose a parameter-less genetic algorithm that relieves the user from having to set the parameters of the GA. Expand
  • 265
  • 15
  • PDF
The gambler's ruin problem, genetic algorithms, and the sizing of populations
TLDR
The paper presents a model for predicting the convergence quality of genetic algorithms that incorporates previous knowledge about decision making in genetic algorithms. Expand
  • 249
  • 12
Learning Linkage
TLDR
Blended learning is a powerful training strategy and approach for any organization seeking to optimize building employee skills and competencies with less time away from the job and lower travel costs. Expand
  • 141
  • 11
Linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm (ECGA)
TLDR
This chapter explores the relationship between the linkage-learning problem and that of learning probability distributions over multi-variate spaces. Expand
  • 111
  • 10
Foundations of Genetic Algorithms
  • 217
  • 4
The gambler''s ruin problem
TLDR
Consider a gambler who starts with an initial fortune of $1 and then on each successive gamble either wins $1 or loses $1 independent of the past with probabilities p and q = 1−p respectively. Expand
  • 45
  • 4
  • PDF