Solving large problems with heuristic search: general-purpose parallel external-memory search

MaRDI QIDQ4564787zbMATH OpenFDO

Authors Matthew Hatem, Ethan Burns, Wheeler Ruml

Publication date 12 June 2018

Full work available at URL https://www.jair.org/index.php/jair/article/view/11209

zbMATH Keywords

parallelizationbest-first searchdisk-based search algorithmscalbility

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Evaluation of a simple, scalable, parallel best-first search strategy
• KI 2004: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 2243390
• Best-first heuristic search for multicore machines
• Publication:3489493

Cited in

(2)

• Best-first heuristic search for multicore machines
• KI 2004: Advances in Artificial Intelligence

This page was built for publication: Solving large problems with heuristic search: general-purpose parallel external-memory search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564787)