A Hybrid Parallel IDA Search

Shubha S. Nerur

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.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.