The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1980 vol.29)
pp: 818-825
O.I. El-Dessouki , Illinois Institute of Technology
ABSTRACT
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.
INDEX TERMS
NP-complete problems, Analysis of distributed algorithms, branch and bound, distributed algorithms, distributed enumeration algorithms, dynamic programming and integer programming, network computers
CITATION
O.I. El-Dessouki, W.H. Huen, "Distributed Enumeration on Between Computers", IEEE Transactions on Computers, vol.29, no. 9, pp. 818-825, September 1980, doi:10.1109/TC.1980.1675681
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool