Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
The average complexity of depth-first search with backtracking and cutoff
IBM Journal of Research and Development
DIB—a distributed implementation of backtracking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Principles of artificial intelligence
Principles of artificial intelligence
Performance of an OR-parallel logic programming system
International Journal of Parallel Programming
Parallel depth first search. Part I. implementation
International Journal of Parallel Programming
Parallel depth first search. Part II. analysis
International Journal of Parallel Programming
Search in Artificial Intelligence
Search in Artificial Intelligence
An almost perfect heuristic for the N nonattacking queens problem
Information Processing Letters
Scalable parallel formulations of depth-first search
Parallel algorithms for machine intelligence and vision
Anomalies in parallel branch-and-bound algorithms
Communications of the ACM
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Automatic Test Pattern Generation on Multiprocessors: A Summary of Results
KBCS '89 Proceedings of the International Conference on Knowledge Based Computer Systems
Superlinear Speedup in Parallel State-Space Search
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
Unstructured tree search on SIMD parallel computers: a summary of results
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
N-Tuple Features for OCR Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
Distributed Test Pattern Generation for Stuck-At Faults in Sequential Circuits
Journal of Electronic Testing: Theory and Applications
Performance analysis for parallel solutions to generic search problems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Parallel cooperative propositional theorem proving
Annals of Mathematics and Artificial Intelligence
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
IEEE Transactions on Knowledge and Data Engineering
Unstructured Tree Search on SIMD Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Optimal schedules for parallelizing anytime algorithms: the case of independent processes
Eighteenth national conference on Artificial intelligence
Annals of Mathematics and Artificial Intelligence
Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning
Journal of Intelligent and Robotic Systems
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Optimizing neural networks on SIMD parallel computers
Parallel Computing
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Interleaved depth-first search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Optimal schedules for parallelizing anytime algorithms: the case of shared resources
Journal of Artificial Intelligence Research
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
Solving the really hard problems with cooperative search
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Parallel search for Ramsey grid colorings
Proceedings of the 50th Annual Southeast Regional Conference
Partitioning Search Spaces of a Randomized Search
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Designing scalable parallel SAT solvers
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Analytical models and experimental results concerning the average case behavior ofparallel backtracking are presented. Two types of backtrack search algorithms areconsidered: simple backtracking, which does not use heuristics to order and prunesearch, and heuristic backtracking, which does. Analytical models are used to comparethe average number of nodes visited in sequential and parallel search for each case. Forsimple backtracking, it is shown that the average speedup obtained is linear when thedistribution of solutions is uniform and superlinear when the distribution of solutions isnonuniform. For heuristic backtracking, the average speedup obtained is at least linear,and the speedup obtained on a subset of instances is superlinear. Experimental results formany synthetic and practical problems run on various parallel machines that validate thetheoretical analysis are presented.