Sciweavers

2 search results - page 1 / 1
» Faster than Weighted A*: An Optimistic Approach to Bounded S...
Sort
View
AIPS
2009
13 years 6 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou