Sciweavers

5289 search results - page 307 / 1058
» Evolutionary Computation for Modeling and Optimization
Sort
View
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 10 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
15 years 10 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
218views Optimization» more  GECCO 2006»
15 years 10 months ago
A survey of mutation techniques in genetic programming
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
Alan Piszcz, Terence Soule
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 10 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
GECCO
2000
Springer
127views Optimization» more  GECCO 2000»
15 years 10 months ago
Evolving Molecules for Drug Design Using Genetic Algorithms via Molecular Trees
We present a new representation for a genetic algorithm to evolve molecular structures representing possible drugs that bind to a given protein target receptor. Our representation...
Gerard Kian-Meng Goh, James A. Foster