- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Agent searching in a tree and the optimality of iterative deepening
Artificial Intelligence 71 (1):195-208 (1994)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
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.
Time complexity of iterative-deepening-A∗.Richard E. Korf, Michael Reid & Stefan Edelkamp - 2001 - Artificial Intelligence 129 (1-2):199-218.
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.
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.
Using knowledge to control tree searching.David E. Wilkins - 1982 - Artificial Intelligence 18 (1):1-51.
Searching for an optimal path in a tree with random costs.Richard M. Karp & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):99-116.
Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
Priority inheritance with backtracking for iterative multi-agent path finding.Keisuke Okumura, Manao Machida, Xavier Défago & Yasumasa Tamura - 2022 - Artificial Intelligence 310 (C):103752.
Analytics
Added to PP
2020-12-22
Downloads
11 (#1,425,715)
6 months
5 (#1,062,008)
2020-12-22
Downloads
11 (#1,425,715)
6 months
5 (#1,062,008)
Historical graph of downloads
Citations of this work
The PN∗-search algorithm: Application to tsume-shogi.Masahiro Seo, Hiroyuki Iida & Jos W. H. M. Uiterwijk - 2001 - Artificial Intelligence 129 (1-2):253-277.
Anytime search in dynamic graphs.Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz & Sebastian Thrun - 2008 - Artificial Intelligence 172 (14):1613-1643.
Controlling the learning process of real-time heuristic search.Masashi Shimbo & Toru Ishida - 2003 - Artificial Intelligence 146 (1):1-41.
Rendezvous in planar environments with obstacles and unknown initial distance.Deniz Ozsoyeller, Andrew Beveridge & Volkan Isler - 2019 - Artificial Intelligence 273 (C):19-36.
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.
References found in this work
Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-221.
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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-ls7fw uwo