Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,954,283 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.
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
2011
2011
Simulation of Seasonal Variation of Marine Boundary Layer Clouds over the Eastern Pacific with a Regional Climate Model
Lei Wang
,
Yuqing Wang
,
A. Lauer
,
S. Xie
2011
Corpus ID: 2069540
AbstractThe seasonal cycle of marine boundary layer (MBL) clouds over the eastern Pacific Ocean is studied with the International…
Expand
2007
2007
The Rise of Household Indebtedness
Christopher Kent
,
Crystal Ossolinski
,
Luke Willard
2007
Corpus ID: 926590
A large rise in household indebtedness has been common to many, though not all, advanced economies over the past few decades and…
Expand
2005
2005
Flexible multi-agent decision making under time pressure
Sanguk Noh
,
P. Gmytrasiewicz
IEEE Transactions on Systems, Man, and…
2005
Corpus ID: 975922
Autonomous agents need considerable computational resources to perform rational decision making. These demands are even more…
Expand
2003
2003
Hybrid Evolutionary And Annealing Algorithms For Nonlinear Discrete Constrained Optimization
B. Wah
,
Yixin Chen
International Journal of Computational…
2003
Corpus ID: 12984676
This paper presents a procedural framework that unifies various mechanisms to look for discrete-neighborhood saddle points in…
Expand
2001
2001
Hybrid constrained simulated annealing and genetic algorithms for nonlinear constrained optimization
B. 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
1993
1993
Improving the Efficiency of Depth-First Search by Cycle Elimination
J. Dillenburg
,
P. Nelson
Information Processing Letters
1993
Corpus ID: 9118545
Review
1993
Review
1993
Techniques for improving the efficiency of heuristic search
J. Dillenburg
1993
Corpus ID: 117542308
Four techniques are presented which improve the efficiency of heuristic search algorithms: agenda data structures, island search…
Expand
1991
1991
Logic Programming, Functional Programming, and Inductive Definitions
Lawrence Charles Paulson
,
Andrew W. Smith
Extensions of Logic Programming
1991
Corpus ID: 47553916
An attempt at unifying logic and functional programming is reported. As a starting point, we take the view that "logic programs…
Expand
1991
1991
The Role of Chess in Artificial Intelligence Research
J. Schaeffer
International Joint Conference on Artificial…
1991
Corpus ID: 447658
Our eminent researchers including John McCarthy, Allen Newell, Claude Shannon, Herb Simon, Ken Thompson and Alan Turing put…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE