Parallel path consistency

@article{Susswein1991ParallelPC,
  title={Parallel path consistency},
  author={Steven Y. Susswein and Thomas C. Henderson and Joseph L. Zachary and Chuck Hansen and Paul A. Hinker and Gary C. Marsden},
  journal={International Journal of Parallel Programming},
  year={1991},
  volume={20},
  pages={453-473}
}
Filtering algorithms are well accepted as a means of speeding up the solution of the consistent labeling problem (CLP). Despite the fact that path consistency does a better job of filtering than arc consistency, AC is still the preferred technique because it has a much lower time complexity. We are implementing parallel path consistency algorithms on multiprocessors and comparing their performance to the best sequential and parallel arc consistency algorithms.(1,2) (See also work by Kerethoet… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 19 references

A fast, efficient path consistency computa t ion can greatly aid in filtering backtrack search

  • N SCONCLUSIO
  • Susswein e t al
  • 1991

Discrete Relaxation Techniques

  • Thomas C. Henderson
  • Parallel Path Consistency
  • 1990

Henderson , Parallel Consistent Labeling Algorithms

  • Ashok Samal, C. Thomas
  • IJPP
  • 1988

Similar Papers

Loading similar papers…