2457 search results - page 173 / 492 » Local Search with Bootstrapping |
159
click to vote
AISC
2004
Springer
15 years 9 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
156
click to vote
GECCO
2003
Springer
15 years 9 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...
117
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...
128
click to vote
CORR
2011
Springer
14 years 7 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...
138
click to vote
ECCV
2006
Springer
16 years 6 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...