Sciweavers

646 search results - page 52 / 130
» Hybrid decision diagrams
Sort
View
ICCTA
2007
IEEE
14 years 24 days ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
CSR
2006
Springer
14 years 18 days 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
DEXA
2006
Springer
80views Database» more  DEXA 2006»
14 years 18 days ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
UAI
2008
13 years 10 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
CSREAESA
2004
13 years 10 months ago
Approaches for Monitoring Vectors on Microprocessor Buses
This paper introduces two new methods for observing and recording the vectors that have been asserted on a bus. The first is a software approach that uses a novel data structure s...
Hector Arteaga, Hussain Al-Asaad