Sciweavers

57 search results - page 7 / 12
» On the Construction of Multiple-Valued Decision Diagrams
Sort
View
PPPJ
2006
ACM
14 years 1 months ago
Experiences with the development of a reverse engineering tool for UML sequence diagrams: a case study in modern Java developmen
The development of a tool for reconstructing UML sequence diagrams from executing Java programs is a challenging task. We implemented such a tool designed to analyze any kind of J...
Matthias Merdes, Dirk Dorsch
AAAI
1996
13 years 9 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
ASPDAC
1998
ACM
72views Hardware» more  ASPDAC 1998»
13 years 12 months ago
Space- and Time-Efficient BDD Construction via Working Set Control
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of proto...
Bwolen Yang, Yirng-An Chen, Randal E. Bryant, Davi...
CSR
2006
Springer
13 years 11 months ago
Extended Resolution Proofs for Conjoining BDDs
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
Carsten Sinz, Armin Biere
UAI
2008
13 years 9 months ago
Identifying reasoning patterns in games
We present an algorithm that identifies the reasoning patterns of agents in a game, by iteratively examining the graph structure of its Multi-Agent Influence Diagram (MAID) repres...
Dimitrios Antos, Avi Pfeffer