Results 1  10
of
1,459,088
New Methods to Find Optimal NonDisjoint BiDecompositions
 IN PROC. ACM/IEEE DESIGN AUTOMATION CONF
, 1998
"... This paper presents new e#cient methods to find "optimal bidecomposition" forms of logic functions. An "optimal bidecomposition" form of f(X) is f = #(g1 (X 1 ),g 2 (X 2 )) where the total number of variables in X 1 and X 2 is the smallest among all bidecomposition for ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
This paper presents new e#cient methods to find "optimal bidecomposition" forms of logic functions. An "optimal bidecomposition" form of f(X) is f = #(g1 (X 1 ),g 2 (X 2 )) where the total number of variables in X 1 and X 2 is the smallest among all bidecomposition
On BiDecompositions of Logic Functions
 Proc. of IWLS '97, Tahoe City
, 1997
"... A logic function f has a disjoint bidecomposition iff f can be represented as f = h(g 1 (X 1 );g 2 (X 2 )), where X 1 and X 2 are disjoint set of variables, and h is an arbitrary twovariable logic fuction. f has a nondisjoint bidecomposition iff f can be represented as f(X 1 ;X 2 ;x)= h(g 1 (X 1 ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
A logic function f has a disjoint bidecomposition iff f can be represented as f = h(g 1 (X 1 );g 2 (X 2 )), where X 1 and X 2 are disjoint set of variables, and h is an arbitrary twovariable logic fuction. f has a nondisjoint bidecomposition iff f can be represented as f(X 1 ;X 2 ;x)= h(g 1 (X
An Efficient Method for Finding an Optimal BiDecomposition
, 1998
"... This paper presents a new efficient method for finding an "optimal" bidecomposition form of a logic function. A bidecomposition form of a logic function is the form: f(X)=ff(g1 (X ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper presents a new efficient method for finding an "optimal" bidecomposition form of a logic function. A bidecomposition form of a logic function is the form: f(X)=ff(g1 (X
An algorithm for bidecomposition of logic functions
 Proc. DAC '01
, 2001
"... We propose a new BDDbased method for decomposition of multioutput incompletely specified logic functions into netlists of twoinput logic gates. The algorithm uses the internal don’tcares during the decomposition to produce compact wellbalanced netlists with short delay. The resulting netlists a ..."
Abstract

Cited by 52 (18 self)
 Add to MetaCart
We propose a new BDDbased method for decomposition of multioutput incompletely specified logic functions into netlists of twoinput logic gates. The algorithm uses the internal don’tcares during the decomposition to produce compact wellbalanced netlists with short delay. The resulting netlists
TimingDriven Logic BiDecomposition
, 2003
"... An approach for logic decomposition that produces circuits with reduced logic depth is presented. It combines two strategies: logic bidecomposition of Boolean functions and treeheight reduction of Boolean expressions. It is a technologyindependent approach that enables one to find treelike expre ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
An approach for logic decomposition that produces circuits with reduced logic depth is presented. It combines two strategies: logic bidecomposition of Boolean functions and treeheight reduction of Boolean expressions. It is a technologyindependent approach that enables one to find tree
Unions of NonDisjoint Theories and Combinations of Satisfiability Procedures
 Theoretical Computer Science
, 2001
"... In this paper we outline a theoretical framework for the combination of decision procedures for constraint satisfiability. We describe a general combination method which, given a procedure that decides constraint satisfiability with respect to a constraint theory T1 and one that decides constraint s ..."
Abstract
 Add to MetaCart
and complete, with special emphasis on the case in which the signatures of the component theories are nondisjoint.
BiDecomposition of Discrete Function Sets
 In 4th International Workshop on Applications of the ReedMuller Expansion
, 1999
"... This paper extends the bidecomposition of Boolean functions by generalizing the notion of Incompletely Specied Functions (ISFs) to the new concept of function sets. In particular, the relation between EXORdecomposition and a special class of function sets, CISFs, is discussed, and the respecti ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper extends the bidecomposition of Boolean functions by generalizing the notion of Incompletely Specied Functions (ISFs) to the new concept of function sets. In particular, the relation between EXORdecomposition and a special class of function sets, CISFs, is discussed
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a
Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
 Evolutionary Computation
, 1994
"... In trying to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about t ..."
Abstract

Cited by 524 (4 self)
 Add to MetaCart
sorting in GAs along with a niche and speciation method to find multiple Paretooptimal points sim...
Results 1  10
of
1,459,088