Sciweavers

255 search results - page 18 / 51
» gecco 2006
Sort
View
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
15 years 10 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 10 months ago
Fitness function for finding out robust solutions on time-varying functions
Evolutionary Computations in dynamic/uncertain environments have attracted much attention. Studies regarding this research subjects can be classified into four categories: Noise, ...
Hisashi Handa
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 10 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 10 months ago
A hybrid genetic search for multiple sequence alignment
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
Seung-Hyun Moon, Sung-Soon Choi, Byung Ro Moon
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
15 years 10 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani