scientific article; zbMATH DE number 4090815

MaRDI QIDQ3817622zbMATH OpenFDO

Authors V. Nageshwara Rao, Vipin Kumar

Publication date 1988

zbMATH Keywords

parallel algorithmparallel best-first branch-and-bound algorithmsparallel depth- first searchsearchingspeedupstate space tree

Mathematics Subject Classification ID

Theory of operating systems (68N25) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the reasons for average superlinear speedup in parallel backtrack search
• Parallel state-space search for a first solution with consistent linear speedups
• scientific article; zbMATH DE number 4178775
• PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
• Parallel depth first search. I: Implementation

Cited in

(10)

• Parallel depth first search. I: Implementation
• Parallel depth first search. II: Analysis
• On superlinear speedups
• Anytime pack search
• PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
• scientific article; zbMATH DE number 4178775 (Why is no real title available?)
• On the reasons for average superlinear speedup in parallel backtrack search
• An experience with super-linear speedup achieved by parallel computing on a workstation cluster: Parallel calculation of density of states of large scale cyclic polyacenes
• Parallel state-space search for a first solution with consistent linear speedups
• An almost perfect heuristic for the N nonattacking queens problem

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 Q3817622)