1566 search results - page 284 / 314 » On a Cone Covering Problem |
201
Voted
ATC
2006
Springer
15 years 7 months ago
2006
Springer
In recent years, a variety of new computing paradigms have been proposed for various purposes. It is true that many of them intend to and really can gratify some of the people some...
117
Voted
AIPS
2010
15 years 6 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
114
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
133
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
125
Voted
CVPR
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we study how to build a vision-based system for global localization with accuracies within 10cm. for robots and humans operating both indoors and outdoors over wide...