Results 1 - 10 of 1,135

Backtrack Search Using ZBDDs

by Fadi A. Aloul, Maher N. Mneimneh, Karem A. Sakallah - Intl. Workshop on Logic and Synthesis, (IWLS , 2001
"... We introduce a new approach to satisfiability that combines backtrack search techniques and zero-suppressed binary decision diagrams (ZBDDs). This approach implicitly represents satisfiability problems using ZBDDs, and performs search using operations on this representation. This methodology which a ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
We introduce a new approach to satisfiability that combines backtrack search techniques and zero-suppressed binary decision diagrams (ZBDDs). This approach implicitly represents satisfiability problems using ZBDDs, and performs search using operations on this representation. This methodology which

Backtracking Search Algorithms

by Peter van Beek , 2006
"... There are three main algorithmic techniques for solving constraint satisfaction problems: backtracking search, local search, and dynamic programming. In this chapter, I survey backtracking search algorithms. Algorithms based on dynamic programming [15]— sometimes referred to in the literature as var ..."
Abstract - Cited by 19 (2 self) - Add to MetaCart
There are three main algorithmic techniques for solving constraint satisfaction problems: backtracking search, local search, and dynamic programming. In this chapter, I survey backtracking search algorithms. Algorithms based on dynamic programming [15]— sometimes referred to in the literature

Deterministic Parallel Backtrack Search

by Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci , 2001
"... The backtrack search problem involves visiting all the nodes of an arbitrary binary tree given a pointer to its root, subject to the constraint that the children of a node are revealed only after their parent is visited. We present a fast, deterministic backtrack search algorithm for a p-processor C ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
The backtrack search problem involves visiting all the nodes of an arbitrary binary tree given a pointer to its root, subject to the constraint that the children of a node are revealed only after their parent is visited. We present a fast, deterministic backtrack search algorithm for a p

Fast Deterministic Backtrack Search

by Kieran Herley, Andrea Pietracaprina, Geppino Pucci , 1996
"... . The backtrack search problem involves visiting all the nodes of an arbitrary binary tree given a pointer to its root, subject to the constraint that the children of a node are revealed only after their parent is visited. This note describes a fast, deterministic backtrack search algorithm for ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
. The backtrack search problem involves visiting all the nodes of an arbitrary binary tree given a pointer to its root, subject to the constraint that the children of a node are revealed only after their parent is visited. This note describes a fast, deterministic backtrack search algorithm

Monad Transformers for Backtracking Search

by Jules Hedges - TO APPEAR IN EPTCS.
"... This paper extends Escardo and Oliva’s selection monad to the selection monad transformer, a general monadic framework for expressing backtracking search algorithms in Haskell. The use of the closely related continuation monad transformer for similar purposes is also discussed, including an implemen ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This paper extends Escardo and Oliva’s selection monad to the selection monad transformer, a general monadic framework for expressing backtracking search algorithms in Haskell. The use of the closely related continuation monad transformer for similar purposes is also discussed, including

PORTFOLIOS WITH DEADLINES FOR BACKTRACKING SEARCH

by Huayue Wu, Peter Van Beek - INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS , 2008
"... Backtracking search is often the method of choice for solving constraint satisfaction and propositional satisfiability problems. Previous studies have shown that portfolios of backtracking algorithms—a selection of one or more algorithms plus a schedule for executing the algorithms—can dramatically ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Backtracking search is often the method of choice for solving constraint satisfaction and propositional satisfiability problems. Previous studies have shown that portfolios of backtracking algorithms—a selection of one or more algorithms plus a schedule for executing the algorithms—can dramatically

Nonsystematic Backtracking Search

by William D. Harvey, Matthew L. Ginsberg , 1995
"... Many practical problems in Artificial Intelligence have search trees that are too large to search exhaustively in the amount of time allowed. Systematic techniques such as chronological backtracking can be applied to these problems, but the order in which they examine nodes makes them unlikely to fi ..."
Abstract - Cited by 56 (1 self) - Add to MetaCart
Many practical problems in Artificial Intelligence have search trees that are too large to search exhaustively in the amount of time allowed. Systematic techniques such as chronological backtracking can be applied to these problems, but the order in which they examine nodes makes them unlikely

Concurrent backtrack search for discsps, in

by Roie Zivan, Amnon Meisels - Proc. FLAIRS-04 , 2004
"... A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SPs) that operate concurrently. Concurrent search processes scan nonintersecting parts of the search space. Each SP is repr ..."
Abstract - Cited by 7 (4 self) - Add to MetaCart
search processes dynamically, starting with the initializing agent, but occurring also at any number of agents during search. The Concurrent BackTracking (ConcBT) algorithm is presented and an outline of the correctness proof is given. Experimental evaluation of the algorithm, on randomly generated Dis

An Overview of Backtrack Search Satisfiability Algorithms

by João Paulo Marques Silva
"... Propositional Satisfiability (SAT) is often used as the underlying model for a significant number of applications in Artificial Intelligence as well as in other fields of Computer Science and Engineering. Algorithmic solutions for SAT include, among others, local search, backtrack search and algebra ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
Propositional Satisfiability (SAT) is often used as the underlying model for a significant number of applications in Artificial Intelligence as well as in other fields of Computer Science and Engineering. Algorithmic solutions for SAT include, among others, local search, backtrack search

Unrestricted Backtrack Search for Propositional Satisfiability

by I. Lynce, L. Baptista, J. Marques-Silva, Sistemas Computadores , 2001
"... This paper proposes a general framework for implementing backtrack search strategies in Propositional Satisfiability (SAT) algorithms, that is referred to as unrestricted backtracking. Different organizations of unrestricted backtracking yield well-known backtrack search strategies. Moreover, this g ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper proposes a general framework for implementing backtrack search strategies in Propositional Satisfiability (SAT) algorithms, that is referred to as unrestricted backtracking. Different organizations of unrestricted backtracking yield well-known backtrack search strategies. Moreover
Results 1 - 10 of 1,135