835 search results - page 64 / 167 » Dynamic populations in genetic algorithms |
112
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
106
Voted
ISDA
2008
IEEE
15 years 7 months ago
2008
IEEE
Both simulated annealing (SA) and the genetic algorithms (GA) are stochastic and derivative-free optimization technique. SA operates on one solution at a time, while the GA mainta...
103
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. ...
114
Voted
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Energy minimization algorithms for bio-molecular systems are critical to applications such as the prediction of protein folding. Conventional energy minimization methods such as th...
98
Voted
NIPS
2007
15 years 2 months ago
2007
Point process encoding models provide powerful statistical methods for understanding the responses of neurons to sensory stimuli. Although these models have been successfully appl...