An Introduction to Genetic Algorithms.
Citations
17,647 citations
Cites methods from "An Introduction to Genetic Algorith..."
...The method used is a type of genetic algorithm [285] or enrichment method [180] that in its simplest form has a number of “agents” that start crawling the Web at random, looking for pages that contain, for example, particular words or sets of words given by the user....
[...]
[...]
17,039 citations
Cites background from "An Introduction to Genetic Algorith..."
...There are many publications which give excellent introductions to genetic algorithms: see Holland (1975), Davis (1987), Goldberg (1989b), Davis (1991), Beasley et al. (1993), Forrest (1993), Reeves (1995), Michalewicz (1996), Mitchell (1996), Falkenauer (1998), Coley (1999), and Man et al. (1999)....
[...]
5,994 citations
Cites background from "An Introduction to Genetic Algorith..."
...• MOMGA & MOMGA II: Although messy GAs are very powerful, their main disadvantages are related to the exponential growth of their population as the size of the building blocks grows (Mitchell, 1996)....
[...]
...This is intended to produce distinct "species" (mating groups) in the population (Mitchell, 1996)....
[...]
3,765 citations
3,672 citations
Cites background from "An Introduction to Genetic Algorith..."
...tree (oblique trees), partDSA (for the model of Molinaro et al. (2010)), and evtree (trees developed using genetic algorithms)....
[...]
...Other approaches such as genetic algorithms (Mitchell 1998) or simplex search methods (Olsson and Nelson 1975) can also find optimal tuning parameters....
[...]