510 search results - page 68 / 102 » Searching Solitaire in Real Time |
152
click to vote
ISAAC
2010
Springer
14 years 11 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
203
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
A system that enables real time query processing on large spatial networks is demonstrated. The system provides functionality for processing a wide range of spatial queries such a...
111
click to vote
OTM
2009
Springer
15 years 8 months ago
2009
Springer
The search for the Holy Grail in achieving interoperability of business processes, services and semantics continues with every new type or search for the Silver Bullet. Most approa...
114
click to vote
SARA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
105
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...