Predicting the size of IDA*ʼs search tree

, &
Artificial Intelligence 196 (C):53-76 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2013.01.001

Links

PhilArchive



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

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 optimal solution costs with bidirectional stratified sampling in regular search spaces.Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner & Robert C. Holte - 2016 - Artificial Intelligence 230 (C):51-73.
Memory search through categories of varying size.William Metlay, Albert Handley & Ira T. Kaplan - 1971 - Journal of Experimental Psychology 91 (2):215.
Fragility and indestructibility of the tree property.Spencer Unger - 2012 - Archive for Mathematical Logic 51 (5-6):635-645.
Display size and the distribution of search times.Ira T. Kaplan, William Metlay & Clifford T. Lyons - 1972 - Journal of Experimental Psychology 95 (2):334.
Satisfiability Testing for Boolean Formulas Using Δ-Trees.G. Gutiérrez, I. P. De Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
Separation results for the size of constant-depth propositional proofs.Arnold Beckmann & Samuel R. Buss - 2005 - Annals of Pure and Applied Logic 136 (1-2):30-55.
Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
Can a small forcing create Kurepa trees.Renling Jin & Saharon Shelah - 1997 - Annals of Pure and Applied Logic 85 (1):47-68.
Food of the Gods: The Search for the Original Tree of Knowledge:Food of the Gods: The Search for the Original Tree of Knowledge.Kirsten Bonde - 1995 - Anthropology of Consciousness 6 (1):35-36.
The differences between Kurepa trees and Jech-Kunen trees.Renling Jin - 1993 - Archive for Mathematical Logic 32 (5):369-379.
Experiments in Visual Perspective: Size Experience.Brentyn Ramm - 2020 - Argumenta 5 (5):263-278.
Spatial Reasoning in Small-size and Large-size Environments: In Search of Early Prefigurations of Spatial Cognition in Small-size Environments.G. Steiner - 1987 - In B. Inhelder, D. De Caprona & A. Cornu-Wells (eds.), Piaget Today. Lawrence Erlbaum. pp. 203--216.
Definition 1.1. 1. A tree is a subset T of< such that for all∈ T, if∈< and⊆, then∈ T. 2. If T is a tree and S⊆ T is also a tree, we say that S is a subtree of T. 3. A tree T is bounded if there exists h:→ such that for all∈ T. [REVIEW]Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3).
A cofinality-preserving small forcing may introduce a special Aronszajn tree.Assaf Rinot - 2009 - Archive for Mathematical Logic 48 (8):817-823.
Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees.Yassine Daadaa, Habib-ur Rehman, Asif Jamshed & Muhammad Atif Tahir - 2015 - Journal of Intelligent Systems 24 (4):479-489.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,439,475)

6 months
5 (#633,186)

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.
Disjoint pattern database heuristics.Richard E. Korf & Ariel Felner - 2002 - Artificial Intelligence 134 (1-2):9-22.

Add more references