70 search results - page 4 / 14 » An exploration of ranking heuristics in mobile local search |
179
click to vote
PPL
2010
15 years 25 days 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...
135
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
— This paper addresses the problem of simultaneous localization and mapping (SLAM) by a mobile robot. The SLAM problem is defined as a global optimization problem in which the o...
165
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
—This article describes a rigorous and complete framework for the simultaneous localization and map building problem for mobile robots: the symmetries and perturbations map (SPma...
133
Voted
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Information Retrieval on the WWW is important because it is hard to find what one is looking for. There is a plethora of information available, and searching relevant information ...
163
click to vote
GECCO
2009
Springer
16 years 19 days ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...