16 citations · 32 across the 2 of their papers we have counts for
Showing cs.NEShow all
2 papers · 1 filter
cs.NE2005★ 16 cited
Decomposable Problems, Niching, and Scalability of Multiobjective Estimation of Distribution Algorithms
Kumara Sastry, Martin Pelikan, David E. Goldberg
The paper analyzes the scalability of multiobjective estimation of distribution algorithms (MOEDAs) on a class of boundedly-difficult additively-separable multiobjective optimizati…
cs.NE2005★ 16 cited
Oiling the Wheels of Change: The Role of Adaptive Automatic Problem Decomposition in Non--Stationary Environments
H. A. Abbass, K. Sastry, D. E. Goldberg
Genetic algorithms (GAs) that solve hard problems quickly, reliably and accurately are called competent GAs. When the fitness landscape of a problem changes overtime, the problem i…