- 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
B∗ probability based search
Artificial Intelligence 86 (1):97-156 (1996)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
The B∗ tree search algorithm—New results.Andrew J. Palay - 1982 - Artificial Intelligence 19 (2):145-163.
The B∗ tree search algorithm: A best-first proof procedure.Hans Berliner - 1979 - Artificial Intelligence 12 (1):23-40.
Consistency-based search in feature selection.Manoranjan Dash & Huan Liu - 2003 - Artificial Intelligence 151 (1-2):155-176.
Sequential model-based diagnosis by systematic search.Patrick Rodler - 2023 - Artificial Intelligence 323 (C):103988.
Conflict-based search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Ariel Felner & Nathan R. Sturtevant - 2015 - Artificial Intelligence 219 (C):40-66.
Local search with constraint propagation and conflict-based heuristics.Narendra Jussien & Olivier Lhomme - 2002 - Artificial Intelligence 139 (1):21-45.
Learning search control knowledge: An explanation-based approach.Gerald F. DeJong & Jonathan Gratch - 1991 - Artificial Intelligence 50 (1):117-127.
Incentive-based search for efficient equilibria of the public goods game.Vadim Levit, Zohar Komarovsky, Tal Grinshpoun & Amnon Meisels - 2018 - Artificial Intelligence 262 (C):142-162.
Width-based search for multi agent privacy-preserving planning.Alfonso E. Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti & Ivan Serina - 2023 - Artificial Intelligence 318 (C):103883.
A crossword solving system based on Monte Carlo tree search.Jingping Liu, Lihan Chen, Sihang Jiang, Chao Wang, Sheng Zhang, Jiaqing Liang, Yanghua Xiao & Rui Song - 2024 - Artificial Intelligence 335 (C):104192.
Analytics
Added to PP
2020-12-22
Downloads
18 (#1,115,326)
6 months
8 (#591,777)
2020-12-22
Downloads
18 (#1,115,326)
6 months
8 (#591,777)
Historical graph of downloads
Citations of this work
A Bayesian approach to relevance in game playing.Eric B. Baum & Warren D. Smith - 1997 - Artificial Intelligence 97 (1-2):195-242.
Pruning algorithms for multi-model adversary search.David Carmel & Shaul Markovitch - 1998 - Artificial Intelligence 99 (2):325-355.
Parallel Randomized Best-First Minimax Search.Yaron Shoham & Sivan Toledo - 2002 - Artificial Intelligence 137 (1-2):165-196.
References found in this work
The B∗ tree search algorithm: A best-first proof procedure.Hans Berliner - 1979 - Artificial Intelligence 12 (1):23-40.
Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
The B∗ tree search algorithm—New results.Andrew J. Palay - 1982 - Artificial Intelligence 19 (2):145-163.
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-2w72m uwo