Sciweavers

350 search results - page 66 / 70
» Particle Swarm Optimization Using Adaptive Mutation
Sort
View
CEC
2008
IEEE
15 years 3 months ago
Scalarization versus indicator-based selection in multi-objective CMA evolution strategies
Abstract—While scalarization approaches to multicriteria optimization become infeasible in the case of many objectives, for few objectives the benefits of populationbased method...
Thomas Voß, Nicola Beume, Günter Rudolp...
ATAL
2009
Springer
15 years 4 months ago
Stigmergic landmark foraging
In this paper, we describe a nature-inspired optimization algorithm based on bee foraging behavior. This algorithm combines the high performance of bee path-integration navigation...
Nyree Lemmens, Karl Tuyls
ECMDAFA
2010
Springer
228views Hardware» more  ECMDAFA 2010»
15 years 22 days ago
Example-Based Sequence Diagrams to Colored Petri Nets Transformation Using Heuristic Search
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
Marouane Kessentini, Arbi Bouchoucha, Houari A. Sa...
NC
1998
138views Neural Networks» more  NC 1998»
14 years 10 months ago
Parallel Adaptive Genetic Algorithm
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
Leo Budin, Marin Golub, Domagoj Jakobovic
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 3 months ago
Acquiring evolvability through adaptive representations
Adaptive representations allow evolution to explore the space of phenotypes by choosing the most suitable set of genotypic parameters. Although such an approach is believed to be ...
Joseph Reisinger, Risto Miikkulainen