Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces

, , , , &
Artificial Intelligence 230 (C):51-73 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2015.09.012

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

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

Predicting the size of IDA*ʼs search tree.Levi H. S. Lelis, Sandra Zilles & Robert C. Holte - 2013 - Artificial Intelligence 196 (C):53-76.
Learning heuristic functions for large state spaces.Shahab Jabbari Arfaee, Sandra Zilles & Robert C. Holte - 2011 - Artificial Intelligence 175 (16-17):2075-2098.
MM: A bidirectional search algorithm that is guaranteed to meet in the middle.Robert C. Holte, Ariel Felner, Guni Sharon, Nathan R. Sturtevant & Jingwei Chen - 2017 - Artificial Intelligence 252 (C):232-266.
Conflict-based search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Ariel Felner & Nathan R. Sturtevant - 2015 - Artificial Intelligence 219 (C):40-66.
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.
The Stratified Spaces of Intern Degrees of Freedom.V. P. Sevrjuk - 2008 - Proceedings of the Xxii World Congress of Philosophy 43:243-253.
Duality in permutation state spaces and the dual search algorithm.Uzi Zahavi, Ariel Felner, Robert C. Holte & Jonathan Schaeffer - 2008 - Artificial Intelligence 172 (4-5):514-540.
Resolving the Raven Paradox: Simple Random Sampling, Stratified Random Sampling, and Inference to Best Explanation.Barry Ward - 2022 - Philosophy of Science 89 (2):360-377.
The Sunk-cost Effect as an Optimal Rate-maximizing Behavior.Theodore P. Pavlic & Kevin M. Passino - 2010 - Acta Biotheoretica 59 (1):53-66.
Regular search spaces.Alberto Momigliano & Mario Ornaghi - unknown
More on regular and decomposable ultrafilters in ZFC.Paolo Lipparini - 2010 - Mathematical Logic Quarterly 56 (4):340-374.
Regular universes and formal spaces.Erik Palmgren - 2006 - Annals of Pure and Applied Logic 137 (1-3):299-316.
Regular Search Spaces (I): Horn and Normal Clauses.Alberto Momigliano & Mario Ornaghi - unknown
Importance sampling-based estimation over AND/OR search spaces for graphical models.Vibhav Gogate & Rina Dechter - 2012 - Artificial Intelligence 184-185 (C):38-77.
Rational deployment of multiple heuristics in optimal state-space search.Erez Karpas, Oded Betzalel, Solomon Eyal Shimony, David Tolpin & Ariel Felner - 2018 - Artificial Intelligence 256 (C):181-210.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,456,201)

6 months
5 (#626,659)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Disjoint pattern database heuristics.Richard E. Korf & Ariel Felner - 2002 - Artificial Intelligence 134 (1-2):9-22.
The heuristic search under conditions of error.Larry R. Harris - 1974 - Artificial Intelligence 5 (3):217-234.

View all 9 references / Add more references