Sciweavers

1159 search results - page 1 / 232
» Binary Decision Graphs
Sort
View
SAS
1999
Springer
13 years 9 months ago
Binary Decision Graphs
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
Laurent Mauborgne
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
13 years 9 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
ICANNGA
2007
Springer
129views Algorithms» more  ICANNGA 2007»
13 years 9 months ago
Multi-class Support Vector Machines Based on Arranged Decision Graphs and Particle Swarm Optimization for Model Selection
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
Javier Acevedo, Saturnino Maldonado-Bascón,...
ICCTA
2007
IEEE
13 years 9 months 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
PLDI
2004
ACM
13 years 10 months ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam