Sciweavers

135 search results - page 14 / 27
» Optimal control problem on insect pest populations
Sort
View
ATAL
2007
Springer
14 years 1 months ago
Convergence and rate of convergence of a simple ant model
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
Amine M. Boumaza, Bruno Scherrer
GECCO
2006
Springer
138views Optimization» more  GECCO 2006»
13 years 11 months ago
Does overfitting affect performance in estimation of distribution algorithms
Estimation of Distribution Algorithms (EDAs) are a class of evolutionary algorithms that use machine learning techniques to solve optimization problems. Machine learning is used t...
Hao Wu, Jonathan L. Shapiro
GECCO
2004
Springer
14 years 1 months ago
Dynamic Limits for Bloat Control: Variations on Size and Depth
Abstract. We present two important variations on a recently successful bloat control technique, Dynamic Maximum Tree Depth, intended at further improving the results and extending ...
Sara Silva, Ernesto Costa
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 1 months ago
Advanced models of cellular genetic algorithms evaluated on SAT
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
Enrique Alba, Hugo Alfonso, Bernabé Dorrons...
GECCO
2011
Springer
264views Optimization» more  GECCO 2011»
12 years 11 months ago
Critical factors in the performance of novelty search
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
Steijn Kistemaker, Shimon Whiteson