On the complexity of admissible search algorithms

Artificial Intelligence 8 (1):1-13 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(77)90002-9

Links

PhilArchive



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

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

Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
HC of an admissible set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.
Noise‐induced sampling of alternative Hamiltonian paths in quantum adiabatic search.Frank Gaitan - 2009 - Complexity 14 (6):21-27.
A Hybrid Cuckoo Search and Simulated Annealing Algorithm.Faisal Alkhateeb & Bilal H. Abed-Alguni - 2019 - Journal of Intelligent Systems 28 (4):683-698.
Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.
On the rules of intermediate logics.Rosalie Iemhoff - 2006 - Archive for Mathematical Logic 45 (5):581-599.
Can an Algorithm be Agonistic? Ten Scenes from Life in Calculated Publics.Kate Crawford - 2016 - Science, Technology, and Human Values 41 (1):77-92.
The computational and experimental complexity of Gene perturbations for regulatory network search.Clark Glymour - unknown
Ranking and unranking algorithms for loopless generation of t-ary trees.Amin Ahmadi-adl, Abbas Nowzari-Dalini & Hayedeh Ahrabian - 2011 - Logic Journal of the IGPL 19 (1):33-43.
On the convergence of a factorized distribution algorithm with truncation selection.Qingfu Zhang - 2004 - Complexity 9 (4):17-23.
Best Unifiers in Transitive Modal Logics.Vladimir V. Rybakov - 2011 - Studia Logica 99 (1-3):321-336.
Algorithms, genetics, and populations: The schemata theorem revisited.Freddy Bugge Christiansen & Marcus W. Feldman - 1998 - Complexity 3 (3):57-64.
Proof theory for admissible rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
Representation operators and computation.Brendan Kitts - 1999 - Minds and Machines 9 (2):223-240.

Analytics

Added to PP
2020-12-22

Downloads
12 (#1,078,270)

6 months
5 (#627,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Probabilistic analysis of the complexity of A∗.Nam Huyn, Rina Dechter & Judea Pearl - 1980 - Artificial Intelligence 15 (3):241-254.
A heuristic search algorithm with modifiable estimate.László Mérõ - 1984 - Artificial Intelligence 23 (1):13-27.
A SIMD approach to parallel heuristic search.Ambuj Mahanti & Charles J. Daniels - 1993 - Artificial Intelligence 60 (2):243-282.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references