151 search results - page 3 / 31 » P-Semiflow Computation with Decision Diagrams |
JSAT
2010
14 years 4 months ago
2010
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...
ECSQARU
2007
Springer
15 years 3 months ago
2007
Springer
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
106
click to vote
EOR
2011
14 years 4 months ago
2011
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...
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
We propose a new type of canonical decision diagrams, which allows a more efficient symbolic state-space generation for general asynchronous systems by allowing on-the-fly extensi...
76
Voted
DEXA
2004
Springer
15 years 1 months ago
2004
Springer
As their field of application has evolved and matured, the importance of verifying knowledge-based systems is now widely recognized. Nevertheless, some problems have remained. In t...