Sciweavers

904 search results - page 34 / 181
» The State Problem for Evolutionary Testing
Sort
View
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 1 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 1 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
GECCO
2006
Springer
129views Optimization» more  GECCO 2006»
14 years 5 days ago
Use of statistical outlier detection method in adaptive evolutionary algorithms
In this paper, the issue of adapting probabilities for Evolutionary Algorithm (EA) search operators is revisited. A framework is devised for distinguishing between measurements of...
James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker
ICIP
2010
IEEE
13 years 6 months ago
Network of evolutionary binary classifiers for classification and retrieval in macroinvertebrate databases
In this paper, we focus on advanced classification and data retrieval schemes that are instrumental when processing large taxonomical image datasets. With large number of classes,...
Serkan Kiranyaz, Moncef Gabbouj, Jenni Pulkkinen, ...
GECCO
2004
Springer
14 years 1 months ago
Towards a Generally Applicable Self-Adapting Hybridization of Evolutionary Algorithms
When applied to real-world problems, the powerful optimization tool of Evolutionary Algorithms frequently turns out to be too time-consuming due to elaborate fitness calculations t...
Wilfried Jakob, Christian Blume, Georg Bretthauer