Results 1  10
of
1,890,580
Factored EdgeValued Binary Decision Diagrams
, 1997
"... Factored EdgeValued Binary Decision Diagrams form an extension to EdgeValued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As a result, the computational complexity for ce ..."
Abstract
 Add to MetaCart
Factored EdgeValued Binary Decision Diagrams form an extension to EdgeValued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As a result, the computational complexity
Factored edgevalued binarydecision diagrams
 Formal Methods in Systems Design
, 1997
"... In this paper we present a new data structure called EdgeValued BinaryDecision Diagrams ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we present a new data structure called EdgeValued BinaryDecision Diagrams
Model Checking with Edgevalued Decision Diagrams
 in Proceedings of the Second NASA Formal Methods Symposium (NFM 2010), NASA/CP2010216215. NASA
, 2010
"... Abstract. We describe an algebra of EdgeValued Decision Diagrams (EVMDDs) to encode arithmetic functions and its implementation in a model checking library along with stateoftheart algorithms for building the transition relation and the state space of discrete state systems. We provide efficien ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We describe an algebra of EdgeValued Decision Diagrams (EVMDDs) to encode arithmetic functions and its implementation in a model checking library along with stateoftheart algorithms for building the transition relation and the state space of discrete state systems. We provide
Factored edgevalued binary decision diagrams
 Formal Methods in System Design
, 1997
"... : : : : : : : : : : 40 ..."
Explaining Propagators for Edgevalued Decision Diagrams
"... Abstract. Propagators that combine reasoning about satisfiability and reasoning about the cost of a solution, such as weighted alldifferent, or global cardinality with costs, can be much more effective than reasoning separately about satisfiability and cost. The costmdd constraint is a generic pro ..."
Abstract
 Add to MetaCart
propagator for reasoning about reachability in a multidecision diagram with costs attached to edges (a generalization of costregular). Previous work has demonstrated that adding nogood learning for mdd propagators substantially increases the size and complexity of problems that can be handled by state
EdgeShifted Decision Diagrams for MultipleValued Logic
, 2001
"... Symbolic data structures for multivalued logics are useful in a number of applications, from modelchecking to circuit design and switchlevel circuit verification. Such data structures are referred to as decision diagrams, and are typically considered effective if they are small, i.e., common cof ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
factors of a function are shared, and canonical, i.e., given a variable ordering, there is a unique decision diagram representing this function. In this paper we propose and evaluate a decision diagram variety, called EdgeShifted Decision Diagrams (ESDDs). These diagrams are multivalued, support structure
On the Construction of MultipleValued Decision Diagrams
, 2002
"... Decision diagrams are the stateoftheart representation for logic functions, both binary and multiplevalued. Here we consider ways to improve the construction of multiplevalued decisions diagrams (MDD). Efficiency is achieved through the use of a simple computed table. We compare the use of recu ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Decision diagrams are the stateoftheart representation for logic functions, both binary and multiplevalued. Here we consider ways to improve the construction of multiplevalued decisions diagrams (MDD). Efficiency is achieved through the use of a simple computed table. We compare the use
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed
Symbolic Boolean manipulation with ordered binarydecision diagrams
 ACM COMPUTING SURVEYS
, 1992
"... Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract

Cited by 1022 (13 self)
 Add to MetaCart
Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
AUTOMATA A Unifying Approach to Edgevalued and Arithmetic Transform Decision Diagrams
, 2000
"... Abstract—This paper shows that binary decision diagrams (BDDs) and their generalizations are not only representations of switching and integervalued functions, but also Fourierlike series expansions of them. Furthermore, it shows that edgevalued binary decision diagrams (EVBDDs) are related to ar ..."
Abstract
 Add to MetaCart
Abstract—This paper shows that binary decision diagrams (BDDs) and their generalizations are not only representations of switching and integervalued functions, but also Fourierlike series expansions of them. Furthermore, it shows that edgevalued binary decision diagrams (EVBDDs) are related
Results 1  10
of
1,890,580