Reducing reexpansions in iterative-deepening search by controlling cutoff bounds

, , &
Artificial Intelligence 50 (2):207-221 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(91)90100-x

Links

PhilArchive



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

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

Refinements to depth-first iterative-deepening search in automatic theorem proving.Xumin Nie & David A. Plaisted - 1989 - Artificial Intelligence 41 (2):223-235.
Efficient exhaustive generation of functional programs using monte-carlo search with iterative deepening.Susumu Katayama - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou (eds.), Pricai 2008: Trends in Artificial Intelligence. Springer. pp. 199--210.
Agent searching in a tree and the optimality of iterative deepening.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1994 - Artificial Intelligence 71 (1):195-208.
A correction to “Agent searching in a tree and the optimality of iterative deepening”.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1995 - Artificial Intelligence 77 (1):173-176.
Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-221.
Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Time complexity of iterative-deepening-A∗.Richard E. Korf, Michael Reid & Stefan Edelkamp - 2001 - Artificial Intelligence 129 (1-2):199-218.
Broadening the Iterative Conception of Set.Mark F. Sharlow - 2001 - Notre Dame Journal of Formal Logic 42 (3):149-170.
The iterative conception of set.Thomas Forster - 2008 - Review of Symbolic Logic 1 (1):97-110.
Between Logic and Heuristic.S. L. Katretchko - 1998 - The Paideia Archive: Twentieth World Congress of Philosophy 8:88-91.
The Search for New Axioms in the Hyperuniverse Programme.Sy-David Friedman & Claudio Ternullo - 2018 - In Carolin Antos, Sy-David Friedman, Radek Honzik & Claudio Ternullo (eds.), The Hyperuniverse Project and Maximality. Basel, Switzerland: Birkhäuser. pp. 161-183.
The Search for New Axioms in the Hyperuniverse Programme.Claudio Ternullo & Sy-David Friedman - 2016 - In Francesca Boccuni & Andrea Sereni (eds.), Objectivity, Realism, and Proof. FilMat Studies in the Philosophy of Mathematics. Cham, Switzerland: Springer International Publishing. pp. 165-188.
Iteratively apprehending pristine experience.Russell Hurlburt - 2009 - Journal of Consciousness Studies 16 (10-12):10-12.
Cut-and-solve: An iterative search strategy for combinatorial optimization problems.Sharlee Climer & Weixiong Zhang - 2006 - Artificial Intelligence 170 (8-9):714-738.
Iterative set theory.M. D. Potter - 1994 - Philosophical Quarterly 44 (171):178-193.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,236,107)

6 months
7 (#417,309)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
BIDA∗: an improved perimeter search algorithm.Giovanni Manzini - 1995 - Artificial Intelligence 75 (2):347-360.

View all 6 citations / Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.

Add more references