Sciweavers

1016 search results - page 134 / 204
» Embedded Computing: New Directions in Architecture and Autom...
Sort
View
DAC
2009
ACM
15 years 11 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
DAC
2010
ACM
14 years 8 months ago
A robust periodic arnoldi shooting algorithm for efficient analysis of large-scale RF/MM ICs
The verification of large radio-frequency/millimeter-wave (RF/MM) integrated circuits (ICs) has regained attention for high-performance designs beyond 90nm and 60GHz. The traditio...
Xuexin Liu, Hao Yu, Sheldon X.-D. Tan
IPPS
2010
IEEE
14 years 8 months ago
Distributed advance network reservation with delay guarantees
New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized schedul...
Niloofar Fazlollahi, David Starobinski
DAC
2008
ACM
15 years 11 months ago
Merging nodes under sequential observability
This paper presents a new type of sequential technology independent synthesis. Building on the previous notions of combinational observability and sequential equivalence, sequenti...
Michael L. Case, Victor N. Kravets, Alan Mishchenk...
DAC
2007
ACM
15 years 11 months ago
Alembic: An Efficient Algorithm for CNF Preprocessing
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
HyoJung Han, Fabio Somenzi