3533 search results - page 153 / 707 » Locally Optimized RANSAC |
154
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
176
click to vote
IWC
2002
15 years 6 months ago
2002
We investigate the application of multi-agent systems to develop intelligent information interfaces for connected communities, a class of computer applications aimed at enhancing ...
184
click to vote
TROB
2011
15 years 1 months ago
2011
—We study the problem of actively searching for an object in a 3D environment under the constraint of a maximum search time, using a visually guided humanoid robot with twentysix...
187
click to vote
PPL
2010
15 years 1 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
146
click to vote
ISBI
2009
IEEE
16 years 1 months ago
2009
IEEE
The inverse problem with distributed dipoles models in M/EEG is strongly ill-posed requiring to set priors on the solution. Most common priors are based on a convenient ℓ2 norm....