Sciweavers

71 search results - page 6 / 15
» The disjunctive decomposition of logic functions
Sort
View
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
15 years 6 months ago
Boolean factoring and decomposition of logic networks
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
Alan Mishchenko, Robert K. Brayton, Satrajit Chatt...
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
15 years 10 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
JDM
2000
82views more  JDM 2000»
14 years 9 months ago
Binary Equivalents of Ternary Relationships in Entity-Relationship Modeling: A Logical Decomposition Approach
Little work has been completed which addresses the logical composition and use of ternary relationships in entity-relationship modeling. Many modeling notations and most CASE tool...
Trevor H. Jones, Il-Yeol Song
LANMR
2004
14 years 11 months ago
New Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
Emad Saad
74
Voted
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
15 years 1 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz