Sciweavers

400 search results - page 23 / 80
» Backtracking
Sort
View
ISQED
2002
IEEE
175views Hardware» more  ISQED 2002»
14 years 2 months ago
On the Relation between SAT and BDDs for Equivalence Checking
State-of-the-art verification tools are based on efficient operations on Boolean formulas. Traditional manipulation techniques are based on Binary Decision Diagrams (BDDs) and SAT...
Sherief Reda, Rolf Drechsler, Alex Orailoglu
IJCAI
2003
13 years 11 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
JAIR
2000
94views more  JAIR 2000»
13 years 9 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
ICPR
2008
IEEE
14 years 4 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
CSMR
2007
IEEE
14 years 4 months ago
The Sisyphus Continuous Integration System
Integration hell is a prime example of software evolution gone out of control. The Sisyphus continuous integration system is designed to prevent this situation in the context of c...
Tijs van der Storm