Journal ArticleDOI
On the efficiency of parallel backtracking
V.N. Rao,Vipin Kumar +1 more
Reads0
Chats0
TLDR
Experimental results for many synthetic and practical problems run on various parallel machines that validate the theoretical analysis are presented, and it is shown that the average speedup obtained is linear when the distribution of solutions is uniform and superlinear when the distributed distribution is nonuniform.Abstract:
Analytical models and experimental results concerning the average case behavior of parallel backtracking are presented. Two types of backtrack search algorithms are considered: simple backtracking, which does not use heuristics to order and prune search, and heuristic backtracking, which does. Analytical models are used to compare the average number of nodes visited in sequential and parallel search for each case. For simple backtracking, it is shown that the average speedup obtained is linear when the distribution of solutions is uniform and superlinear when the distribution of solutions is nonuniform. For heuristic backtracking, the average speedup obtained is at least linear, and the speedup obtained on a subset of instances is superlinear. Experimental results for many synthetic and practical problems run on various parallel machines that validate the theoretical analysis are presented. >read more
Citations
More filters
Journal ArticleDOI
Propositional Satisfiability and Constraint Programming: A comparative survey
TL;DR: This survey overviews the two areas of Propositional Satisfiability and Constraint Programming in a comparative way, emphasizing the similarities and differences between the two and the points where one technology can benefit from ideas or experience acquired from the other.
Proceedings Article
Backtracking in Distributed Constraint Networks
TL;DR: This paper presents a new search procedure for finding a solution in a distributed constraint net- work, based on the principle of backtracking to ensure the completeness of search, that allows a high level of asyn- chronism.
Journal ArticleDOI
Solving large FPT problems on coarse-grained parallel machines
TL;DR: The potential of parallelism when applied to the bounded-tree search phase of FPT algorithms is demonstrated, thereby allowing even larger problem instances to be solved in practice.
Journal ArticleDOI
State of the art in parallel search techniques for discrete optimization problems
Ananth Grama,Vipin Kumar +1 more
TL;DR: The state of the art in parallel algorithms used for solving discrete optimization problems, including heuristic and nonheuristic techniques for searching graphs as well as trees, and speed-up anomalies in parallel search that are caused by the inherent speculative nature of search techniques are described.
Journal ArticleDOI
Asynchronous partial overlay: a new algorithm for solving distributed constraint satisfaction problems
Roger Mailler,Victor Lesser +1 more
TL;DR: This article presents a new complete, distributed algorithm called asynchronous partial overlay (APO) for solving DCSPs that is based on a cooperative mediation process and empirical evidence shows that APO outperforms other known, complete DCSP techniques.
References
More filters
Book
Principles of Artificial Intelligence
TL;DR: This classic introduction to artificial intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval.
Heuristics : Intelligent Search Strategies for Computer Problem Solving
TL;DR: This book presents, characterizes and analyzes problem solving strategies that are guided by heuristic information and provides examples of how these strategies have changed over time.
Journal ArticleDOI
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
TL;DR: PODEM (path-oriented decision making) is a new test generation algorithm for combinational logic circuits that uses an implicit enumeration approach analogous to that used for solving 0-1 integer programming problems and is significantly more efficient than DALG over the general spectrum of combinational Logic circuits.
Book
Heuristics : intelligent search strategies for computer problem solving
TL;DR: In this article, the authors present, characterizes and analyzes problem solving strategies that are guided by heuristic information, and characterise and analyze problem-solving strategies with heuristics.