Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

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

From MaRDI portal
Publication:4564787
Jump to:navigation, search

zbMATH Open1444.68173MaRDI QIDQ4564787FDOQ4564787


Authors: Matthew Hatem, Ethan Burns, Wheeler Ruml Edit this on Wikidata


Publication date: 12 June 2018


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




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


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)



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4564787&oldid=18705209"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 11:48. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki