Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Efficient and Accurate Parallel Genetic Algorithms
Efficient and Accurate Parallel Genetic Algorithms
An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Analysis of selection algorithms: A markov chain approach
Evolutionary Computation
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Selection intensity in cellular evolutionary algorithms for regular lattices
IEEE Transactions on Evolutionary Computation
Emergent mating topologies in spatially structured genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Using pair approximations to predict takeover dynamics in spatially structured populations
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Takeover times on scale-free topologies
Proceedings of the 9th annual conference on Genetic and evolutionary computation
An analysis of the effects of population structure on scalable multiobjective optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
The influence of scaling and assortativity on takeover times in scale-free topologies
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A study of NK landscapes' basins and local optima networks
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Power-efficient gossiping in multi-hop ad hoc networks
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Pair approximations of takeover dynamics in regular population structures
Evolutionary Computation
On the Role of Structured Information Exchange in Supervised Learning
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Evolving specific network statistical properties using a gene regulatory network model
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Data-intensive computing for competent genetic algorithms: a pilot study using meandre
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Evolutionary dynamics on scale-free interaction networks
IEEE Transactions on Evolutionary Computation
Multiobjective evolutionary algorithms on complex networks
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Resilience to churn of a peer-to-peer evolutionary algorithm
International Journal of High Performance Systems Architecture
EvAg: a scalable peer-to-peer evolutionary algorithm
Genetic Programming and Evolvable Machines
Effect of topology on diversity of spatially-structured evolutionary algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Empirical analysis of the spatial genetic algorithm on small-world networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Sexual recombination in self-organizing interaction networks
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Effects of scale-free and small-world topologies on binary coded self-adaptive CEA
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
We present discrete stochastic mathematical models for the growth curves of synchronous and synchronous evolutionary algorithms with populations structured ccording to a random graph. We show that, to good approximation, randomly structured and panmictic populations have the some growth behavior. Furthermore, we show that global selection intensity depends on the update policy. The validity of the models is confirmed by comparison with experimental results of simulations. We also present experimental results on small-world nd scale-free population graph topologies. We show that they lead to qualitatively similar results. However, the different nature of the nodes can be exploited to obtain more varied evolutionary behavior.