Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation
From MaRDI portal
Publication:3072379
DOI10.1080/17445761003604521zbMATH Open1209.68176DBLPjournals/paapp/Mahafzah11OpenAlexW2051659302WikidataQ58215145 ScholiaQ58215145MaRDI QIDQ3072379FDOQ3072379
Authors: Basel A. Mahafzah
Publication date: 3 February 2011
Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/17445761003604521
Recommendations
Cites Work
- The traveling salesman problem. A computational study.
- Introduction to algorithms
- Title not available (Why is that?)
- Depth-first iterative-deepening: An optimal admissible tree search
- Disjoint pattern database heuristics
- On the asymptotic performance of IDA
- Parallel depth first search. I: Implementation
- \(\text{BIDA}^*\): An improved perimeter search algorithm
- Multithreaded constraint programming: A hybrid approach
- IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH
- A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
- ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks
Cited In (1)
Uses Software
This page was built for publication: Parallel multithreaded IDA\(*\) heuristic search: algorithm design and performance evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072379)