Sciweavers

200 search results - page 28 / 40
» On the convergence of multi-parent genetic algorithms
Sort
View
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 1 months ago
Towards billion-bit optimization via a parallel estimation of distribution algorithm
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
Kumara Sastry, David E. Goldberg, Xavier Llor&agra...
CSI
2006
136views more  CSI 2006»
13 years 7 months ago
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
AISB
1994
Springer
13 years 11 months ago
An Empirical Comparison of Selection Methods in Evolutionary Algorithms
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
Peter J. B. Hancock
GECCO
2006
Springer
134views Optimization» more  GECCO 2006»
13 years 11 months ago
Incorporating directional information within a differential evolution algorithm for multi-objective optimization
The field of Differential Evolution (DE) has demonstrated important advantages in single objective optimization. To date, no previous research has explored how the unique characte...
Antony W. Iorio, Xiaodong Li
CEC
2007
IEEE
14 years 1 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao