Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
A* search algorithmBeam searchBranch and boundCombinatorial search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Intelligent-search technique based strategic placement of synchronized measurements for power system observability
2011
2011
CPN-TWS: a coloured petri-net approach for transactional-QoS driven Web Service composition
In this paper, we address the issue of selecting and composing Web Services (WSs) considering functional and Quality of Service… 
2005
2005
A practical generalization of Fourier-based learning
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The… 
2005
2005
Optimal Scheduling with Heuristic Best First Search
A* Nilsson´s algorithm is a systematic search paradigm that allows for exploiting domain knowledge to obtain optimal solutions… 
Highly Cited
1993
Highly Cited
1993
Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
Best-first search is a widely used problem solving technique in the field of artificial intelligence. The method has useful… 
1993
1993
Bidirectional Best-First Search with Bounded Error: Summary of Results
For more than two decades there has been consensus that bidirectional heuristic search is afflicted by the problem of search… 
Highly Cited
1991
Highly Cited
1991
Depth-first vs best-first search
We present a comparison of three well known heuristic search algorithms: best-first search (BFS), iterative-deepening (ID), and… 
1991
1991
Effects of brood size on inter-clutch intervals, offspring development and male-female interactions in the ring dov Streptopelia risoria
1988
1988
A parallel best-first search
The best-first search method is commonly employed in searching a dynamic search space with heuristic information which allows the… 
1986
1986
A Best-First Search Algorithm for Optimal PLA Folding
In this paper we propose a new algorithm for optimal PLA folding based on a graph theoretic formulation. An efficient best-first… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)