- 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
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
Artificial Intelligence 21 (1-2):179-198 (1983)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1457-1491.
General Branch and Bound, and its relation to A∗ and AO∗.Dana S. Nau, Vipin Kumar & Laveen Kanal - 1984 - Artificial Intelligence 23 (1):29-58.
Monte Carlo tree search in Kriegspiel.Paolo Ciancarini & Gian Piero Favini - 2010 - Artificial Intelligence 174 (11):670-684.
A comparison of minimax tree search algorithms.Murray S. Campbell & T. A. Marsland - 1983 - Artificial Intelligence 20 (4):347-367.
The B∗ tree search algorithm—New results.Andrew J. Palay - 1982 - Artificial Intelligence 19 (2):145-163.
Predicting the size of IDA*ʼs search tree.Levi H. S. Lelis, Sandra Zilles & Robert C. Holte - 2013 - Artificial Intelligence 196 (C):53-76.
Branch and bound algorithms to solve semiring constraint satisfaction problems.Louise Leenen & Aditya Ghose - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou (eds.), Pricai 2008: Trends in Artificial Intelligence. Springer. pp. 991--997.
Some methods of controlling the tree search in chess programs.G. M. Adelson-Velskiy, V. L. Arlazarov & M. V. Donskoy - 1975 - Artificial Intelligence 6 (4):361-371.
Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
Local search characteristics of incomplete SAT procedures.Dale Schuurmans & Finnegan Southey - 2001 - Artificial Intelligence 132 (2):121-150.
Analytics
Added to PP
2020-12-22
Downloads
4 (#1,642,306)
6 months
3 (#1,046,148)
2020-12-22
Downloads
4 (#1,642,306)
6 months
3 (#1,046,148)
Historical graph of downloads
Citations of this work
A minimax algorithm better than alpha-beta? Yes and No.Igor Roizen & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):199-220.
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.
Generalization of alpha-beta and SSS∗ search procedures.T. Ibaraki - 1986 - Artificial Intelligence 29 (1):73-117.
General Branch and Bound, and its relation to A∗ and AO∗.Dana S. Nau, Vipin Kumar & Laveen Kanal - 1984 - Artificial Intelligence 23 (1):29-58.
References found in this work
An analysis of alpha-beta pruning.Donald E. Knuth & Ronald W. Moore - 1975 - Artificial Intelligence 6 (4):293-326.
The B∗ tree search algorithm: A best-first proof procedure.Hans Berliner - 1979 - Artificial Intelligence 12 (1):23-40.
A minimax algorithm better than alpha-beta?G. C. Stockman - 1979 - Artificial Intelligence 12 (2):179-196.
A minimax algorithm better than alpha-beta? Yes and No.Igor Roizen & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):199-220.
General Branch and Bound, and its relation to A∗ and AO∗.Dana S. Nau, Vipin Kumar & Laveen Kanal - 1984 - Artificial Intelligence 23 (1):29-58.
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-68866f4b87-sz9d2 uwo