70 search results - page 2 / 14 » An exploration of ranking heuristics in mobile local search |
JAIR
2006
13 years 4 months ago
2006
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
AI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
IROS
2008
IEEE
13 years 11 months ago
2008
IEEE
— This article addresses the problem of autonomous map building and exploration of an unknown environment with mobile robots. The proposed method assumes that mobile robots use o...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
AIR
2004
13 years 4 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...