Parallel Heuristic Search in Haskell
by
Michelle Cope
,
Ian Gent
,
Kevin Hammond
BibTeX
@MISC{Cope_parallelheuristic,
author = {Michelle Cope and Ian Gent and Kevin Hammond},
title = { Parallel Heuristic Search in Haskell},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algorithm extended with conflict-directed backjumping (CBJ). Encouraging preliminary results for the GpH parallel dialect of the non-strict functional programming language Haskell suggest that modest real speedup can be achieved for the most interesting hard search cases.
