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.
2019
2019
Search behavior of greedy best-first search
Greedy best-first search (GBFS) is a sibling of A* in the family of best-first state-space search algorithms. While A* is… 
2017
2017
DINAS: A Lightweight and Efficient Distributed Naming Service for All-IP Wireless Sensor Networks
The Internet of Things (IoT) requires a compact naming scheme, which can also bring significant advantages to service… 
2013
2013
Prolog with best first search
Prolog is a logic programming language with an engine that can search a knowledge base with respect to a query automatically. To… 
2008
2008
Skyline ranking for uncertain data with maybe confidence
Skyline queries have been actively studied lately as they can effectively identify interesting candidate objects with low… 
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… 
2004
2004
Diagnosis as Semiring-Based Constraint Optimization
Constraint optimization is at the core of many problems in Artificial Intelligence. In this paper, we frame model-based diagnosis… 
2003
2003
Outlier Detection Using Default Logic
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic… 
1997
1997
Best-First Search for Property Maintenance in Reactive Constraint Systems
Real-life dynamic problems may lead to inconsistent constraints systems for which a solution must be found even if constraints… 
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)