Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,229,785 papers from all fields of science
Search
Sign In
Create Free Account
Iterative deepening depth-first search
Known as:
Depth-limited search
, ITDFS
, Depth-first search with iterative deepening
Expand
In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Alpha–beta pruning
Branching factor
Breadth-first search
Computer chess
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Combination of various data analysis techniques for efficient track reconstruction in very high multiplicity events
F. Siklér
2017
Corpus ID: 54612572
A novel combination of established data analysis techniques for reconstructing charged-particles in high energy collisions is…
Expand
2016
2016
The Effect of Domain Modeling on Efficiency of Planning
R. Barták
,
J. Vodrázka
International Symposium on Artificial…
2016
Corpus ID: 212684330
It is known that a planning domain model influences performance of planners, but so far there have been only limited studies how…
Expand
2015
2015
The Effective Pathfinding Algorithm for Gaming Maps Using Systemized Iterative Deepening A
Abhilash Sreeramaneni
,
Chan Koh
2015
Corpus ID: 60919092
A * algorithm is the de facto standard used for a pathfinding search. IDA* is a space-efficient version of A * , but it suffers…
Expand
2014
2014
ShrdLite: Semantic Parsing Using a Handmade Grammar
Peter Ljunglöf
International Workshop on Semantic Evaluation
2014
Corpus ID: 13455658
This paper describes my approach for parsing robot commands, which was task 6 at SemEval 2014. My solution is to manually create…
Expand
2012
2012
Iterative-deepening search with on-line tree size prediction
E. Burns
,
Wheeler Ruml
Annals of Mathematics and Artificial Intelligence
2012
Corpus ID: 9650993
The memory requirements of best-first graph search algorithms such as A* often prevent them from solving large problems. The best…
Expand
2012
2012
Perbandingan Answer Set Programming dan Iterative Deepening Search dalam Menyelesaikan Game N-puzzle
Teguh Fajar Nurbiansyah
2012
Corpus ID: 64867909
Review
2002
Review
2002
Partial Order Evaluation in Game Tree Search , and its Application to Analyzing Semeai in the Game of Go
M. Mfiller
2002
Corpus ID: 16116044
We revisit the problem of constructing an evaluation function for game tree search. While the standard model assumes a numeric…
Expand
2001
2001
Hybrid constrained simulated annealing and genetic algorithms for nonlinear constrained optimization
Benjamin W. Wah
,
Yixin Chen
Proceedings of the Congress on Evolutionary…
2001
Corpus ID: 16066854
The paper presents a framework that unifies various search mechanisms for solving constrained nonlinear programming (NLP…
Expand
Review
1996
Review
1996
A Survey on Finite Domain Programming in Oz
J. Org
,
W. Urtz
,
T. Uller
1996
Corpus ID: 18412572
This paper describes the nite domain system embedded in Oz, a higher-order concurrent constraint language with encapsulated…
Expand
1991
1991
Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming
A. Di Pierro
,
M. Martelli
,
C. Palamidessi
International Conference on Logic Programming
1991
Corpus ID: 24206531