Skip to search formSkip to main contentSkip to account menu

Admissible heuristic

Known as: Inadmissible heuristic, Optimistic heuristic 
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
15 puzzleA* search algorithmAlgorithmComputer science

Broader (1)

Artificial intelligence

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2010
Review
2010
Traditions in Conflict: The Internationalization of Confrontation
This article considers international norms concerning the right to adversarial confrontation in positing a normative analytical… 
Highly Cited
2009
Highly Cited
2009
Robust H ∞ sliding mode control for a class of uncertain switched delay systems
This article considers the robust H ∞ sliding mode control problem for a class of uncertain switched delay systems. A single… 
2009
2009
The admissibility of expert evidence in criminal proceedings in England and Wales : a new approach to the determination of evidentiary reliability : a consultation paper
The current law governing the admissibility of expert evidence in criminal trials is unsatisfactory. If the reliability of expert… 
2002
2002
Conjectures and Exhumations: Citations of History, Philosophy and Sociology of Science in US Federal Courts
This article examines the circumstances in which a version of Sir Karl Popper’s philosophy of science became US law. Among… 
Highly Cited
1992
Highly Cited
1992
Lexicographic probabilities and iterated admissibility
Review
1991
Review
1991
Admissibility in blind adaptive channel equalization
A tutorial survey is presented of an open problem, namely, the admissibility of the memory-less-error-function class of blind… 
Highly Cited
1990
Highly Cited
1990
Fractal pattern of second-order non-linear digital filters: A new symbolic analysis
This paper studies the three-valued symbolic dynamics associated with the second-order non-linear digital filter which has been… 
Highly Cited
1981
Highly Cited
1981
On the design of relational database schemata
The purpose of this paper is to present a new approach to the conceptual design of relational databases based on the complete… 
Highly Cited
1979
Highly Cited
1979
The structure of admissible points with respect to cone dominance
We study the set of admissible (Pareto-optimal) points of a closed, convex setX when preferences are described by a convex, but… 
Highly Cited
1976
Highly Cited
1976
Generalized AND/OR Graphs
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)