PARLOG: parallel programming in logic
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Random Trees and the Analysis of Branch and Bound Procedures
Journal of the ACM (JACM)
Analysis of Or-parallel execution models
ACM Transactions on Programming Languages and Systems (TOPLAS)
Performance analysis for parallel solutions to generic search problems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Parallel execution of prolog programs: a survey
ACM Transactions on Programming Languages and Systems (TOPLAS)
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
IEEE Transactions on Knowledge and Data Engineering
Optimal schedules for parallelizing anytime algorithms: the case of independent processes
Eighteenth national conference on Artificial intelligence
Very fast motion planning for dexterous robots
ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning
Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning
Journal of Intelligent and Robotic Systems
Parallel test generation and execution with Korat
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Optimal schedules for parallelizing anytime algorithms: the case of shared resources
Journal of Artificial Intelligence Research
Are many reactive agents better than a few deliberative ones?
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Paper: Automatic test pattern generation on parallel processors
Parallel Computing
Partitioning Search Spaces of a Randomized Search
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Scaling symbolic execution using ranged analysis
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
| Hi-index | 14.98 |
A technique for parallel backtracking using randomization is proposed. Its main advantage is that good speedups are possible with little or no interprocessor communication. The speedup obtainable is problem-dependent. In those cases where the problem size becomes very large, randomization is extremely successful achieving good speedups. The technique also ensures high reliability, flexibility, and fault tolerance.