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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Boundary searches were introduced in pathfinding aiming to find a middle-ground between memory intensive algorithms such as the A… (More)
  • table I
  • figure 1
  • table II
  • figure 3
  • figure 4
Is this relevant?
2012
2012
The container relocation problem, where containers that are stored in bays are retrieved in a fixed sequence, is a crucial port… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Time series are a ubiquitous form of data occurring in virtually every scientific discipline and business application. There has… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
Many of the artiicial intelligence techniques developed to date rely on heuristic search through large spaces. Unfortunately, the… (More)
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Many search trees are impractical ly large to explore exhaustively. Recently, techniques like l imi ted discrepancy search have… (More)
Is this relevant?
Review
1994
Review
1994
Iterative-deepening searches mimic a breadth-first node expansion with a series of depth-first searches that operate with… (More)
Is this relevant?
1994
1994
We analyze and compare the scalability of two generic schemes for heuristic depthrst search on highly parallel MIMD systems. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
Best-first search (BFS) expands the fewest nodes among all admissible algorithms using the same cost function, but typically… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1991
1985
1985
The complexities of various search algorithms are considered in terms of time, space, and cost of the solution paths. • Brute… (More)
  • figure 2
  • table 1
Is this relevant?