Results 1  10
of
491
Disjoint sum forms in reliability theory
 ORiON J. OR Society South Africa
"... The structure function ϕ of a binary monotone system is assumed to be known and given in a disjunctive normal form, i.e. as the logical union of products of the indicator variables of the states of its subsystems. Based on this representation of ϕ, an improved Abraham algorithm is proposed for gener ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
for generating the disjoint sum form of ϕ. This form is the base for subsequent numerical reliability calculations. The approach is generalized to multivalued systems. Examples are discussed. 1.
Disjoint Sums over Type Classes in HOL
 Proceedings of TPHOLs’99
, 1999
"... . The standard versions of HOL only support disjoint sums over finite families of types. This paper introduces disjoint sums over type classes containing possibly a countably infinite number of monomorphic types. The result is a monomorphic sum type together with an overloaded function which rep ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. The standard versions of HOL only support disjoint sums over finite families of types. This paper introduces disjoint sums over type classes containing possibly a countably infinite number of monomorphic types. The result is a monomorphic sum type together with an overloaded function which
Disjoint Sum of Product Minimization by Evolutionary Algorithms
 Applications of Evolutionary Computing, Evo Workshops
"... Recently, an approach has been presented to minimize Disjoint Sumof Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Recently, an approach has been presented to minimize Disjoint Sumof Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques.
A semantics of multiple inheritance
 Information and Computation
, 1988
"... There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types) and func ..."
Abstract

Cited by 528 (9 self)
 Add to MetaCart
There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types
Utilizing BDDs For Disjoint SOP Minimization
 In 45th IEEE International Midwest Symposium on Circuits and Systems
, 2002
"... The application of Binary Decision Diagrams (BDDs) as an efficient approach for the minimization of Disjoint SumsofProducts (DSOPs) is discussed. DSOPs are a starting point for several applications. The use of BDDs has the advantage of an implicit representation of terms. Due to this scheme the al ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
The application of Binary Decision Diagrams (BDDs) as an efficient approach for the minimization of Disjoint SumsofProducts (DSOPs) is discussed. DSOPs are a starting point for several applications. The use of BDDs has the advantage of an implicit representation of terms. Due to this scheme
Variants of the MinSum LinkDisjoint Paths Problem
"... A survivable connection usually requires computing linkdisjoint primary and backup paths. Finding a minsum pair of linkdisjoint paths whose total cost is minimized can be solved in polynomial time. However, adding extra requirements may render the problem NPcomplete. In this paper, we study diff ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A survivable connection usually requires computing linkdisjoint primary and backup paths. Finding a minsum pair of linkdisjoint paths whose total cost is minimized can be solved in polynomial time. However, adding extra requirements may render the problem NPcomplete. In this paper, we study
The Sum Number of a Disjoint Union of Graphs
"... In this paper we consider the disjoint union of graphs as sum graphs. We provide an upper bound on the sum number of a disjoint union of graphs and provide an application for the exclusive sum number of a graph. We conclude with some open problems. ..."
Abstract
 Add to MetaCart
In this paper we consider the disjoint union of graphs as sum graphs. We provide an upper bound on the sum number of a disjoint union of graphs and provide an application for the exclusive sum number of a graph. We conclude with some open problems.
Maximum EdgeDisjoint Paths in kSums of Graphs
, 2013
"... We consider the approximability of the maximum edgedisjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be Ω( n) even for planar graphs [14] due to a simple topological ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We consider the approximability of the maximum edgedisjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be Ω( n) even for planar graphs [14] due to a simple topological
Computation of Disjoint Cube Representations Using a Maximal Binate Variable Heuristic
, 2002
"... A method for computing the DisjointSumOfProducts (DSOP) form of Boolean functions is described. The algorithm exploits the property of the most binate variable in a set of cubes to compute a DSOP form. The technique uses a minimized SumOfProducts (SOP) cube list as input. Experimental results c ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A method for computing the DisjointSumOfProducts (DSOP) form of Boolean functions is described. The algorithm exploits the property of the most binate variable in a set of cubes to compute a DSOP form. The technique uses a minimized SumOfProducts (SOP) cube list as input. Experimental results
A Hybrid Approach Combining Symbolic and Structural Techniques for Disjoint SOP Minimization
 In Workshop on Synthesis And System Integration of Mixed Information technologies (SASIMI
, 2003
"... Up to now only monolithic approaches have been used to minimize Disjoint SumofProducts (DSOPs). Here, a hybrid approach is introduced by tightly integrating Binary Decision Diagrams (BDDs) as a symbolic strategy with structural methods. BDDs have the advantage of an implicit representation of cube ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Up to now only monolithic approaches have been used to minimize Disjoint SumofProducts (DSOPs). Here, a hybrid approach is introduced by tightly integrating Binary Decision Diagrams (BDDs) as a symbolic strategy with structural methods. BDDs have the advantage of an implicit representation
Results 1  10
of
491