- 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
Performance of linear-space search algorithms
Artificial Intelligence 79 (2):241-292 (1995)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
On the complexity of admissible search algorithms.Alberto Martelli - 1977 - Artificial Intelligence 8 (1):1-13.
A comparison of minimax tree search algorithms.Murray S. Campbell & T. A. Marsland - 1983 - Artificial Intelligence 20 (4):347-367.
Pruning algorithms for multi-model adversary search.David Carmel & Shaul Markovitch - 1998 - Artificial Intelligence 99 (2):325-355.
Linear-time algorithms for testing the realisability of line drawings of curved objects.Martin C. Cooper - 1999 - Artificial Intelligence 108 (1-2):31-67.
Planning as satisfiability: parallel plans and algorithms for plan search.Jussi Rintanen, Keijo Heljanko & Ilkka Niemelä - 2006 - Artificial Intelligence 170 (12-13):1031-1080.
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT.Holger H. Hoos & Thomas Stützle - 1999 - Artificial Intelligence 112 (1-2):213-232.
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search.P. P. Chakrabarti - 1994 - Artificial Intelligence 65 (2):329-345.
Simple and efficient bi-objective search algorithms via fast dominance checks.Carlos Hernández, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig & Oren Salzman - 2023 - Artificial Intelligence 314 (C):103807.
Practical performance models of algorithms in evolutionary program induction and other domains.Mario Graff & Riccardo Poli - 2010 - Artificial Intelligence 174 (15):1254-1276.
Analytics
Added to PP
2020-12-22
Downloads
14 (#1,275,508)
6 months
5 (#1,038,502)
2020-12-22
Downloads
14 (#1,275,508)
6 months
5 (#1,038,502)
Historical graph of downloads
Citations of this work
The increasing cost tree search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Meir Goldenberg & Ariel Felner - 2013 - Artificial Intelligence 195 (C):470-495.
Memory-limited model-based diagnosis.Patrick Rodler - 2022 - Artificial Intelligence 305 (C):103681.
Best-first minimax search.Richard E. Korf & David Maxwell Chickering - 1996 - Artificial Intelligence 84 (1-2):299-337.
Potential-based bounded-cost search and Anytime Non-Parametric A ⁎.Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah & Ken Goldberg - 2014 - Artificial Intelligence 214 (C):1-25.
Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.
References found in this work
Phase transitions in artificial intelligence systems.Bernardo A. Huberman & Tad Hogg - 1987 - Artificial Intelligence 33 (2):155-171.
Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-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-559df78dcc-6qn2c uwo