 |
    |
A Caching Genetic Algorithm for Spectral Breakpoint Matching
Jonathan Mohr1 and Xiaobo Li2
1Augustana University College, Camrose, Alberta, Canada T4V 2R3
mohrj@augustana.ca
http://www.augustana.ca/~mohrj/
2University of Alberta, Edmonton, Alberta, Canada T6G 2M7
li@cs.ualberta.ca
http://www.cs.ualberta.ca/~li/
Abstract. Two methods were evaluated for performing spectral breakpoint matching: a multi-level pruned exhaustive search and a genetic algorithm. The GA found matches about as good as those found by pruned search, but savings in time were realized only if the objective function cached the results of previous evaluations.
LNCS 3103, p. 1320 f.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2004