1159 search results - page 98 / 232 » Binary Decision Graphs |
150
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
180
click to vote
DAC
1999
ACM
15 years 10 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
160
click to vote
DATE
1998
IEEE
15 years 10 months ago
1998
IEEE
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
182
click to vote
CIARP
2009
Springer
15 years 10 months ago
2009
Springer
Authorship verification is the task of determining whether documents were or were not written by a certain author. The problem has been faced by using binary classifiers, one per a...
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...