1717 search results - page 58 / 344 » On the analysis of the (1 1) memetic algorithm |
164
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Linear Discriminant Analysis (LDA) is a well-known and important tool in pattern recognition with potential applications in many areas of research. The most famous and used formul...
190
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
170
click to vote
ALGORITHMICA
1998
15 years 5 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
151
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
236
click to vote
TCS
2008
15 years 6 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...