scientific article; zbMATH DE number 4162302

MaRDI QIDQ3489495zbMATH OpenFDO

Authors Curt Powley, Richard E. Korf

Publication date 1989

zbMATH Keywords

iterative-deepening \(A^ *\) search algorithmordered parallel window search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• PARALLEL IMPRECISE ITERATIVE DEEPENING FOR COMBINATORIAL OPTIMIZATION
• Effective use of memory in iterative deepening search
• On the asymptotic performance of IDA
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Depth-first iterative-deepening: An optimal admissible tree search

Cited in

(3)

• Parallel planning via the distribution of operators
• Parallel state-space search for a first solution with consistent linear speedups
• Ideal point guided iterative deepening

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3489495)