On the efficiency of parallel backtracking
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 4 (4) , 427-437
- https://doi.org/10.1109/71.219757
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Automatic test pattern generation on parallel processorsParallel Computing, 1991
- A parallel branch and bound algorithm for test generationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Parallel Algorithms for Machine Intelligence and VisionPublished by Springer Nature ,1990
- Performance of an OR-parallel logic programming systemInternational Journal of Parallel Programming, 1988
- Search in Artificial IntelligencePublished by Springer Nature ,1988
- Parallel depth first search. Part I. ImplementationInternational Journal of Parallel Programming, 1987
- The average complexity of depth-first search with backtracking and cutoffIBM Journal of Research and Development, 1986
- Parallel Branch-and-Bound Formulations for AND/OR Tree SearchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search ProblemsIEEE Transactions on Computers, 1984