Parallel Greedy Best-First Search with a Bound on the Number of Expansions Relative to Sequential Search

Open in new window