Evaluation of a simple, scalable, parallel best-first search strategy
type: Item
instance of: scholarly article
title: Evaluation of a simple, scalable, parallel best-first search strategy
zbMATH Open document ID: 1270.68271
author: Akihiro Kishimoto
author: Adi Botea
author: Alex Fukunaga
published in: Artificial Intelligence
publication date: 2013-08-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1201.3204
full work available at URL: S0004370212001294
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6201439
MaRDI profile type: Publication
OpenAlex ID: W1965334268
arXiv ID: 1201.3204
DOI: 10.1016/J.ARTINT.2012.10.007
Recommended article: An empirical investigation on parallelization strategies for scatter search
Recommended article: Performances of parallel branch and bound algorithms with best-first search
Recommended article: On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
Recommended article: Best-First Heuristic Search for Multicore Machines
Recommended article: The scalability analysis of a parallel tree search algorithm
Recommended article: A study of parallel branch-and-bound algorithms with best-bound-first search
Recommended article: Q4895237
Recommended article: Parallel randomized best-first minimax search.
Recommended article: On Hash-Based Work Distribution Methods for Parallel Best-First Search
description: scientific article; zbMATH DE number 6201439