548 search results - page 6 / 110 » Using the Genetic Algorithm to Find Snake-in-the-Box Codes |
EVOW
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper i...
SAC
2000
ACM
14 years 4 hour ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
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...
WCNC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we demonstrate that our ability to match the EXtrinsic Information Transfer (EXIT) function of an Irregular Variable Length Code (IrVLC) to that of a seriallyconc...
GECCO
2003
Springer
14 years 26 days ago
2003
Springer
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...