Skip to search formSkip to main contentSkip to account menu

Iterative deepening depth-first search

Known as: Depth-limited search, ITDFS, Depth-first search with iterative deepening 
In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The memory requirements of best-first graph search algorithms such as A* often prevent them from solving large problems. The best… 
2011
2011
AbstractThe seasonal cycle of marine boundary layer (MBL) clouds over the eastern Pacific Ocean is studied with the International… 
2007
2007
A large rise in household indebtedness has been common to many, though not all, advanced economies over the past few decades and… 
Review
2007
Review
2007
This report gives a detailed discussion on the system, algorithms, and techniques that we have applied in order to solve the Web… 
2004
2004
Most approaches for model checking software are based on the generation of abstract models from source code, which may greatly… 
2003
2003
This paper presents a procedural framework that unifies various mechanisms to look for discrete-neighborhood saddle points in… 
2001
2001
This chapter extends Anderson’s (1990) rational analysis of problem solving to a class of exploratory search situations that… 
2001
2001
  • B. WahYixin Chen
  • 2001
  • Corpus ID: 16066854
The paper presents a framework that unifies various search mechanisms for solving constrained nonlinear programming (NLP…