# Iterative deepening depth-first search

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- CIT
- 2013

Boundary searches were introduced in pathfinding aiming to find a middle-ground between memory intensive algorithms such as the Aâ€¦Â (More)

Is this relevant?

2012

2012

- IEEE Transactions on Automation Science andâ€¦
- 2012

The container relocation problem, where containers that are stored in bays are retrieved in a fixed sequence, is a crucial portâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- SDM
- 2002

Time series are a ubiquitous form of data occurring in virtually every scientific discipline and business application. There hasâ€¦Â (More)

Is this relevant?

1998

1998

- J. Artif. Intell. Res.
- 1998

Many of the artiicial intelligence techniques developed to date rely on heuristic search through large spaces. Unfortunately, theâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- IJCAI
- 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

- IEEE Trans. Pattern Anal. Mach. Intell.
- 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

- Parallel Processing of Discrete Optimizationâ€¦
- 1994

We analyze and compare the scalability of two generic schemes for heuristic depthrst search on highly parallel MIMD systems. Theâ€¦Â (More)

Is this relevant?

1993

1993

- AAAI
- 1993

Best-first search (BFS) expands the fewest nodes among all admissible algorithms using the same cost function, but typicallyâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- 1991

Â

Is this relevant?

1985

1985

- Artif. Intell.
- 1985

The complexities of various search algorithms are considered in terms of time, space, and cost of the solution paths. â€¢ Bruteâ€¦Â (More)

Is this relevant?