Combinatorially implosive algorithms
From MaRDI portal
Publication:3953182
DOI10.1145/358656.358678zbMath0491.68061OpenAlexW1992598731MaRDI QIDQ3953182
Publication date: 1982
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358656.358678
parallelismparallel algorithmheuristic searchparallel processing languagesreducing the average time behaviour of search algorithms
Searching and sorting (68P10) Theory of operating systems (68N25) Algorithms in computer science (68W99)
Related Items
A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile ⋮ Branch \& Sample: A simple strategy for constraint satisfaction ⋮ Data-movement-intensive problems: Two folk theorems in parallel computation revisited
