63 search results - page 3 / 13 » Better Huffman Coding via Genetic Algorithm |
GECCO
2005
Springer
13 years 11 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...
KES
1998
Springer
13 years 10 months ago
1998
Springer
Abstract--Recombination operator plays a very important role in genetic algorithms. In this paper, we present binary coded genetic algorithms in which more than two parents are inv...
GECCO
2000
Springer
13 years 9 months ago
2000
Springer
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
EVOW
2010
Springer
14 years 4 days 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...
CVPR
1998
IEEE
14 years 7 months ago
1998
IEEE
This paper addresses robust feature tracking. We extend the well-known Shi-Tomasi-Kanade tracker by introducing an automatic scheme for rejecting spurious features. We employ a si...