Results 21 to 30 of about 3,866,349 (62)
Decision diagrams in machine learning: an empirical study on real-life credit-risk data. [PDF]
Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result of which the produced classifiers might become too large to be ...
Files, CM +3 more
core
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs [PDF]
, 2008 Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input correspondence is unknown and finding support-reducing bound sets.
Kettle, Neil +3 more
core +1 more source
Building free Binary Decision Diagrams using SAT solvers
, 2007 Free Binary Decision Diagrams (FBDDs) are a data structure for the representation of Boolean functions. In contrast to Ordered Binary Decision Diagrams (OBDDs) FBDDs allow different variable orderings along each path.
Görschwin Fey +2 more
core +1 more source
Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs [PDF]
, 1999 Ordered Binary Decision Diagrams (OBDDs) have already proved useful in the verification of combinational and sequential circuits. Due to limitations of the descriptive power of OBDDs several more general models of Binary Decision Diagrams have been ...
Meinel, Christoph, Sack, Harald
core +1 more source
On OBDDs for CNFs of bounded treewidth [PDF]
, 2014 In this paper we show that a CNF cannot be compiled into an Ordered Binary Decision Diagram (OBDD) of fixed-parameter size parameterized by the primal graph treewidth of the input CNF.
Razgon, Igor
core +3 more sources
Anytime Algorithms for ROBDD Symmetry Detection and Approximation [PDF]
Reduced Ordered Binary Decision Diagrams (ROBDDs) provide a dense and memory efficient representation of Boolean functions. When ROBDDs are applied in logic synthesis, the problem arises of detecting both classical and generalised symmetries.
Kettle, Neil
core
Efficient Set Sharing Using ZBDDs [PDF]
, 2008 Set sharing is an abstract domain in which each concrete object is represented by the set of local variables from which it might be reachable. It is a useful abstraction to detect parallelism opportunities, since it contains definite information about ...
Mario Méndez-Lojo +5 more
core +1 more source
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
, 1994 We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the Davis-Putnam procedure. Experimental results indicate that the Davis-Putnam procedure outperforms obdds in hard constraint-satisfaction
Tomás E. Uribe, Mark E. Stickel
core
OBDDs, SDDs, and circuits of bounded width: completeness matters [PDF]
Ordered Binary Decision Diagrams (OBDDs) are dynamic data structures with many application areas. The literature suggested that OBDDs of bounded width equate to Boolean circuits of bounded pathwidth.
de Colnet, A. +5 more
core +1 more source
, 2013 Ordered Binary Decision Diagrams (OBDDs) are a widely used data structure for Boolean function manipulation. In particular, OBDDs are commonly used in CAD for the synthesis and verification of integrated circuits.
Lago Lorenzo +2 more
core +1 more source