Sciweavers

224 search results - page 22 / 45
» Algorithms for Solving Boolean Satisfiability in Combination...
Sort
View
TCAD
1998
126views more  TCAD 1998»
15 years 3 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli
NC
2006
116views Neural Networks» more  NC 2006»
15 years 3 months ago
Automated Design and Programming of a Microfluidic DNA Computer
Previously, we described ways to implement the functions AND and OR in a DNA computer consisting of microreactors with attached heating elements that control annealing of DNA. Base...
Michael S. Livstone, Ron Weiss, Laura F. Landweber
123
Voted
MJ
2007
87views more  MJ 2007»
15 years 3 months ago
Using SAT-based techniques in power estimation
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
Assim Sagahyroon, Fadi A. Aloul
115
Voted
VLSID
2002
IEEE
135views VLSI» more  VLSID 2002»
16 years 4 months ago
An Efficient Algorithm for Low Power Pass Transistor Logic Synthesis
In this paper, we address the problem of power dissipation minimization in combinational circuits implemented using pass transistor logic (PTL). We transform the problem of power ...
Rupesh S. Shelar, Sachin S. Sapatnekar
CASC
2007
Springer
133views Mathematics» more  CASC 2007»
15 years 10 months ago
Algebraic Visualization of Relations Using RelView
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...
Rudolf Berghammer, Gunther Schmidt