3533 search results - page 85 / 707 » Locally Optimized RANSAC |
149
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
169
click to vote
DAWAK
2005
Springer
15 years 12 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
160
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satis abilit...
160
click to vote
ANTSW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The visual localization problem in robotics poses a dynamically changing environment due to the movement of the robot compared to a static image set serving as environmen...
179
click to vote
ISCI
2008
15 years 6 months ago
2008
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...