Sciweavers

1159 search results - page 13 / 232
» Binary Decision Graphs
Sort
View
CAP
2010
13 years 2 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
EOR
2011
140views more  EOR 2011»
13 years 2 months ago
Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
Stefan Bolus
ICSE
2004
IEEE-ACM
14 years 7 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
TWC
2010
13 years 2 months ago
Near-capacity iterative decoding of binary self-concatenated codes using soft decision demapping and 3-D EXIT charts
In this paper 3-D Extrinsic Information Transfer (EXIT) charts are used to design binary Self-Concatenated Convolutional Codes employing Iterative Decoding (SECCC-ID), exchanging e...
Muhammad Fasih Uddin Butt, Raja Ali Riaz, Soon Xin...