Sciweavers

102 search results - page 16 / 21
» New Particle Swarm Optimization Algorithm Incorporating Repr...
Sort
View
IICAI
2003
13 years 8 months ago
A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
Ketan Kotecha, Nilesh Gambhava
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
13 years 11 months ago
Adaptive evolution: an efficient heuristic for global optimization
This paper presents a novel evolutionary approach to solve numerical optimization problems, called Adaptive Evolution (AEv). AEv is a new micro-population-like technique because i...
Francisco Viveros Jiménez, Efrén Mez...
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
14 years 26 days ago
Pricing the 'free lunch' of meta-evolution
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
Alexei V. Samsonovich, Kenneth A. De Jong
ICASSP
2011
IEEE
12 years 11 months ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew
CEC
2009
IEEE
14 years 2 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben