Sciweavers

1407 search results - page 159 / 282
» Join-Graph Propagation Algorithms
Sort
View
DAC
1998
ACM
14 years 1 months ago
Approximate Reachability with BDDs Using Overlapping Projections
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
Shankar G. Govindaraju, David L. Dill, Alan J. Hu,...
EURODAC
1994
IEEE
148views VHDL» more  EURODAC 1994»
14 years 1 months ago
BiTeS: a BDD based test pattern generator for strong robust path delay faults
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
Rolf Drechsler
PLDI
1993
ACM
14 years 1 months ago
Dependence-Based Program Analysis
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
Richard Johnson, Keshav Pingali
DBKDA
2009
IEEE
99views Database» more  DBKDA 2009»
14 years 28 days ago
An Adaptive Synchronization Policy for Harvesting OAI-PMH Repositories
Metadata harvesting requires timely propagation of up-to-date information from thousands of Repositories over a wide area network. It is desirable to keep the data as fresh as poss...
Noha Adly
CP
2008
Springer
13 years 10 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon