3533 search results - page 74 / 707 » Locally Optimized RANSAC |
198
click to vote
AROBOTS
2002
15 years 6 months ago
2002
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
196
click to vote
AAAI
2000
15 years 7 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
187
click to vote
DCOSS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
158
click to vote
ESANN
2007
15 years 7 months ago
2007
In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub similarities at rando...
182
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
The success of decoder-based evolutionary algorithms (EAs) strongly depends on the achieved locality of operators and decoders. Most approaches to investigate locality properties ...