Sciweavers

6943 search results - page 696 / 1389
» Representations for evolutionary algorithms
Sort
View
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 11 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
15 years 11 months ago
Bounding XCS's parameters for unbalanced datasets
This paper analyzes the behavior of the XCS classifier system on imbalanced datasets. We show that XCS with standard parameter settings is quite robust to considerable class imbal...
Albert Orriols-Puig, Ester Bernadó-Mansilla
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 11 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 11 months ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing
EVOW
2000
Springer
15 years 11 months ago
Prediction of Power Requirements for High-Speed Circuits
Modern VLSI design methodologies and manufacturing technologies are making circuits increasingly fast. The quest for higher circuit performance and integration density stems from f...
Fulvio Corno, Maurizio Rebaudengo, Matteo Sonza Re...