Agent searching in a tree and the optimality of iterative deepening

, &
Artificial Intelligence 71 (1):195-208 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(94)90066-3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

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 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.
Searching game trees under a partial order.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1996 - Artificial Intelligence 82 (1-2):237-257.
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds.U. K. Sarkar, P. P. Chakrabarti, S. Ghose & S. C. De Sarkar - 1991 - Artificial Intelligence 50 (2):207-221.
Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
A simple geometrical pattern for the branching distribution of the bronchial tree, useful to estimate optimality departures.Mauricio Canals, Francisco F. Novoa & Mario Rosenmann - 2004 - Acta Biotheoretica 52 (1):1-16.
Time complexity of iterative-deepening-A∗.Richard E. Korf, Michael Reid & Stefan Edelkamp - 2001 - Artificial Intelligence 129 (1-2):199-218.
Min-max Computation Tree Logic.Pallab Dasgupta, P. P. Chakrabarti, Jatindra Kumar Deka & Sriram Sankaranarayanan - 2001 - Artificial Intelligence 127 (1):137-162.
Refinements to depth-first iterative-deepening search in automatic theorem proving.Xumin Nie & David A. Plaisted - 1989 - Artificial Intelligence 41 (2):223-235.
Optimality and Teleology in Aristotle's Natural Science.Devin Henry - manuscript
Goal decomposition tree: An agent model to generate a validated agent behaviour.Gaële Simon, Bruno Mermet & Dominique Fournier - 2006 - In P. Torroni, U. Endriss, M. Baldoni & A. Omicini (eds.), Declarative Agent Languages and Technologies Iii. Springer. pp. 124--140.
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.
Optimality modeling in a suboptimal world.Angela Potochnik - 2009 - Biology and Philosophy 24 (2):183-197.
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.
Optimality bias in moral judgment.Julian De Freitas & Samuel G. B. Johnson - 2018 - Journal of Experimental Social Psychology 79:149-163.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,466,820)

6 months
5 (#648,401)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Real-time heuristic search.Richard E. Korf - 1990 - Artificial Intelligence 42 (2-3):189-211.
Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.

Add more references