Sciweavers

1159 search results - page 161 / 232
» Binary Decision Graphs
Sort
View
ICIAR
2005
Springer
14 years 3 months ago
On the Individuality of the Iris Biometric
We consider quantitatively establishing the discriminative power of iris biometric data. It is difficult, however, to establish that any biometric modality is capable of distingui...
Sungsoo Yoon, Seung-Seok Choi, Sung-Hyuk Cha, Yill...
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
14 years 3 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
AUSAI
2004
Springer
14 years 3 months ago
Set Bounds and (Split) Set Domain Propagation Using ROBDDs
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey
CP
2004
Springer
14 years 3 months ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
FMCAD
2004
Springer
14 years 3 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi