Sciweavers

1547 search results - page 121 / 310
» Randomized Variable Elimination
Sort
View
118
Voted
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
15 years 10 months ago
Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
Almitra Pradhan, Ranga Vemuri
ICALP
2007
Springer
15 years 9 months ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret
DATE
2006
IEEE
85views Hardware» more  DATE 2006»
15 years 9 months ago
Optimizing high speed arithmetic circuits using three-term extraction
Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by ext...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
CP
2005
Springer
15 years 9 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
CSL
2005
Springer
15 years 9 months ago
Light Functional Interpretation
We give a Natural Deduction formulation of an adaptation of G¨odel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proof...
Mircea-Dan Hernest