B∗ probability based search

&
Artificial Intelligence 86 (1):97-156 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(95)00092-5

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

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

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.
Learning search control knowledge: An explanation-based approach.Gerald F. DeJong & Jonathan Gratch - 1991 - Artificial Intelligence 50 (1):117-127.
Local search with constraint propagation and conflict-based heuristics.Narendra Jussien & Olivier Lhomme - 2002 - Artificial Intelligence 139 (1):21-45.
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.
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.
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.

Analytics

Added to PP
2020-12-22

Downloads
21 (#1,105,144)

6 months
8 (#521,746)

Historical graph of downloads
How can I increase my 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.
Parallel Randomized Best-First Minimax Search.Yaron Shoham & Sivan Toledo - 2002 - Artificial Intelligence 137 (1-2):165-196.

Add more citations

References found in this work

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.
The SUPREM architecture.Hans Berliner & Carl Ebeling - 1986 - Artificial Intelligence 28 (1):3-8.

Add more references