A Hybrid Parallel IDA Search

Abstract

Heuristic search is a fundamental problem-solving method in artificial intelligence. The main limitation of search is its computational complexity which can be overcome by parallel implementation of the algorithms. Distributed tree search and Parallel window search are two of the approaches to parallelizing search algorithms.

Cite

Text

Nerur. "A Hybrid Parallel IDA Search." AAAI Conference on Artificial Intelligence, 1994.

Markdown

[Nerur. "A Hybrid Parallel IDA Search." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/nerur1994aaai-hybrid/)

BibTeX

@inproceedings{nerur1994aaai-hybrid,
  title     = {{A Hybrid Parallel IDA Search}},
  author    = {Nerur, Shubha S.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1994},
  pages     = {1479},
  url       = {https://mlanthology.org/aaai/1994/nerur1994aaai-hybrid/}
}