The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Program partitioning and load balancing in network computers.
Program partitioning and load balancing in network computers.
Computer structures: Readings and examples (McGraw-Hill computer science series)
Computer structures: Readings and examples (McGraw-Hill computer science series)
Optimal Sorting Algorithms for Parallel Computers
IEEE Transactions on Computers
A Task Allocation Model for Distributed Computing Systems
IEEE Transactions on Computers
MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
IEEE Transactions on Computers
The architecture of MANIP: a parallel computer system for solving NP-complete problems
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees
Journal of Parallel and Distributed Computing
Correction to "distributed enumeration on between computers"
IEEE Transactions on Computers
| Hi-index | 14.99 |
Known solutions of a large number of important (and difficult) computational problems called NP-complete problems depend on enumeration techniques which examine all feasible alternatives. This paper considers the design of enumeration schemes in a distributed environment in an attempt to exploit the parallel activities inherent in enumeration algorithms.