Sciweavers

2550 search results - page 22 / 510
» Difference Decision Diagrams
Sort
View
EOR
2011
140views more  EOR 2011»
14 years 8 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
16 years 1 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
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 8 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
84
Voted
QEST
2009
IEEE
15 years 8 months ago
Petri Net Analysis Using Decision Diagrams
Gianfranco Ciardo