Fine-Grained Parallel Genetic Algorithms

By Bernard Manderick, P. Spiessens. 1989

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Multiagent Learning: Basics, Challenges, and Prospects (2012, background): “…systems and flocking or herding behavior (Manderick and Moyson 1988; Colorni, Dorigo, and Maniezzo 1992; Banerjee 1992), evolutionary computation (Manderick and Spiessens 1989; Steels 1987, 1988; Paredis 1995), social learning (Boyd and Richerson 1985; Laland, Richerson, and Boyd 1993), neural…”
Parallelism and evolutionary algorithms (2002, methodology): “However, the truly interesting observation is that the use of a structured population , that is, a spatial distribution of individuals, either in the form of a set of islands [126] or a diffusion grid [81], [116], is the responsible of such benefits.”
An analysis of particle swarm optimizers (2002, methodology): “ulations, the resulting model is called the neighbourhood model [88, 80].”
Gradual distributed real-coded genetic algorithms (2000, methodology): “Examples of cellular GA’s are to be found in [13], [14], [44], and [49].”