Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

SFP
2000

favoriteEmaildiscussreport

169views Programming Languages» more SFP 2000»

Parallel heuristic search in Haskell

13 years 5 months ago

Parallel heuristic search in Haskell

Download www.cs.st-andrews.ac.uk

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.

Michelle Cope, Ian P. Gent, Kevin Hammond

Real-time Traffic

GpH Parallel Dialect | Parallel Heuristic Search | Search Algorithms | SFP 2000 | SFP 2001 |

claim paper

Related Content

» The Parallel Variable Neighborhood Search for the pMedian Problem

» Parallel Iterative A Search An Admissible Distributed Heuristic Search Algorithm

» Suboptimal and Anytime Heuristic Search on MultiCore Machines

» Integrating Machine Learning in Parallel Heuristic Search

» Cooperative Parallel Tabu Search for Capacitated Network Design

» Parallel Search for Combinatorial Optimization Genetic Algorithms Simulated Annealing Tabu...

» Comparing Different Serial and Parallel Heuristics to Design Combinational Logic Circuits

» HardwareSoftware Partitioning with Iterative Improvement Heuristics

» Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	SFP
Authors	Michelle Cope, Ian P. Gent, Kevin Hammond

Comments (0)