Probabilistic analysis of the complexity of A∗

, &
Artificial Intelligence 15 (3):241-254 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(80)90045-4

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A Proposed Probabilistic Extension of the Halpern and Pearl Definition of ‘Actual Cause’.Luke Fenton-Glynn - 2017 - British Journal for the Philosophy of Science 68 (4):1061-1124.
Tractable inference for probabilistic data models.Lehel Csato, Manfred Opper & Ole Winther - 2003 - Complexity 8 (4):64-68.
A Proposed Probabilistic Extension of the Halpern and Pearl Definition of ‘Actual Cause’.Luke Fenton-Glynn - 2017 - British Journal for the Philosophy of Science 68 (4):1061-1124.
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.
Probabilistic Grammars and Languages.András Kornai - 2011 - Journal of Logic, Language and Information 20 (3):317-328.
A probabilistic theory of coherence.Branden Fitelson - 2003 - Analysis 63 (3):194–199.
Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P.Veronica Biazzo, Angelo Gilio, Thomas Lukasiewicz & Giuseppe Sanfilippo - 2002 - Journal of Applied Non-Classical Logics 12 (2):189-213.
Interactive and probabilistic proof-checking.Luca Trevisan - 2000 - Annals of Pure and Applied Logic 104 (1-3):325-342.
Structure identification in relational data.Rina Dechter & Judea Pearl - 1992 - Artificial Intelligence 58 (1-3):237-270.
Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
Robust stability analysis of stochastic neural networks with Markovian jumping parameters and probabilistic time-varying delays.Chandrasekar Pradeep, Arunachalam Chandrasekar, Rangasamy Murugesu & Rajan Rakkiyappan - 2016 - Complexity 21 (5):59-72.
Uncovering trees in constraint networks.Itay Meiri, Rina Dechter & Judea Pearl - 1996 - Artificial Intelligence 86 (2):245-267.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
Causality: Models, Reasoning and Inference.Judea Pearl - 2000 - New York: Cambridge University Press.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,219,856)

6 months
9 (#298,039)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
Knowledge versus search.Judea Pearl - 1983 - Artificial Intelligence 20 (1):1-13.

Add more citations

References found in this work

The heuristic search under conditions of error.Larry R. Harris - 1974 - Artificial Intelligence 5 (3):217-234.
On the complexity of admissible search algorithms.Alberto Martelli - 1977 - Artificial Intelligence 8 (1):1-13.
On the optimality of A∗.David Gelperin - 1977 - Artificial Intelligence 8 (1):69-76.

Add more references