Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Best-first search

Known as: Best first search, Pure heuristic search, BFS 
Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule. Judea Pearl… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
© Copyright 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. It has been… Expand
  • table 1
  • figure 1
  • table 2
Is this relevant?
2012
2012
Compressed sensing is a developing field aiming at the reconstruction of sparse signals acquired in reduced dimensions, which… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 2.1
  • figure 2.2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We describe how to convert the heuristic search algorithm A* into an anytime algorithm that finds a sequence of improved… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Recent work shows that the memory requirements of best-first heuristic search can be reduced substantially by using a divide-and… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We introduce a new algorithm, K-best-first search (KBFS), which is a generalization of the well known best-first search (BFS). In… Expand
  • figure 7
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset… Expand
  • figure I
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Abstract Best-first search is a general heuristic search algorithm that always expands next a frontier node of lowest cost. It… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
This paper reports several properties of heuristic best-first search strategies whose scoring functions ƒ depend on all the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?