Sciweavers

48 search results - page 2 / 10
» Genetic Algorithms for Ambiguous Labelling Problems
Sort
View
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
13 years 9 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
13 years 11 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
ICPR
2004
IEEE
14 years 6 months ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo
ICCV
2007
IEEE
14 years 7 months ago
Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
Faguo Yang, Frithjof Kruggel
CISS
2008
IEEE
13 years 12 months ago
A genetic algorithm for designing constellations with low error floors
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
Matthew C. Valenti, Raghu Doppalapudi, Don J. Torr...