Sciweavers

2147 search results - page 259 / 430
» Evolutionary Algorithms
Sort
View
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
16 years 1 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
IPPS
2006
IEEE
16 years 19 days ago
Parallel implementation of a quartet-based algorithm for phylogenetic analysis
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutio...
Bing Bing Zhou, Daniel Chu, Monther Tarawneh, Ping...
GECCO
2007
Springer
124views Optimization» more  GECCO 2007»
15 years 10 months ago
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...
Riccardo Poli, Leonardo Vanneschi
ATAL
2010
Springer
15 years 7 months ago
Frequency adjusted multi-agent Q-learning
Multi-agent learning is a crucial method to control or find solutions for systems, in which more than one entity needs to be adaptive. In today's interconnected world, such s...
Michael Kaisers, Karl Tuyls
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 10 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge