50 search results - page 3 / 10 » Dynamic Search-Space Pruning Techniques in Path Sensitizatio... |
SSD
2005
Springer
13 years 10 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
DEXA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
IJCAI
2007
13 years 6 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
DAC
2008
ACM
14 years 5 months ago
2008
ACM
Since process and environmental variations can no longer be ignored in high-performance microprocessor designs, it is necessary to develop techniques for computing the sensitiviti...
PVLDB
2010
13 years 2 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...