2654 search results - page 122 / 531 » On Pairing Inversion Problems |
149
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
144
Voted
LATIN
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
144
Voted
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
159
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
129
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Under the homoscedastic Gaussian assumption, it has been shown that Fisher’s linear discriminant analysis (FLDA) suffers from the class separation problem when the dimensionalit...