Changing the distribution depth during a parallel tree search

DOI10.1007/BFB0002875MaRDI QIDQ4537127zbMATH OpenFDO

Authors Nicolas Prcovic

Publication date 6 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002875

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel depth-bounded discrepancy search
• scientific article; zbMATH DE number 4162692
• Parallel search in bivalued game trees
• scientific article; zbMATH DE number 2100400
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems

Cited in

(2)

• Parallel depth first search. I: Implementation
• Parallel depth-bounded discrepancy search

This page was built for publication: Changing the distribution depth during a parallel tree search

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