Sciweavers

754 search results - page 45 / 151
» An Ordered Logic Program Solver
Sort
View
ISSTA
2004
ACM
15 years 6 months ago
Automating commutativity analysis at the design level
Two operations commute if executing them serially in either order results in the same change of state. In a system in which commands may be issued simultaneously by different use...
Greg Dennis, Robert Seater, Derek Rayside, Daniel ...
105
Voted
ICCV
2011
IEEE
14 years 19 days ago
Trajectory reconstruction from non-overlapping surveillance cameras with relative depth ordering constraints
We present a method for reconstructing a trajectory of an object moving in front of non-overlapping fully or partially calibrated cameras. The non-overlapping setup turns that pro...
Branislav Micusik
92
Voted
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
15 years 7 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
89
Voted
ICLP
2005
Springer
15 years 6 months ago
A Type System for CHR
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
Emmanuel Coquery, François Fages
101
Voted
CADE
2007
Springer
16 years 27 days ago
Predictive Labeling with Dependency Pairs Using SAT
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
Adam Koprowski, Aart Middeldorp