Parallel heuristic search in Haskell

Parallel heuristic search in Haskell,Michelle Cope,Ian P. Gent,Kevin Hammond

Parallel heuristic search in Haskell   (Citations: 2)
BibTex | RIS | RefWorks Download
Parallel heuristic search algorithms are widely used in artificial intelli- gence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algo- rithm extended with conflict-directed backjumping (CBJ). Encouraging prelimi- nary 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.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: