6095 search results - page 343 / 1219 » Learning in Local Search |
188
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
162
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
189
Voted
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
304
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
237
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...