Sciweavers

101 search results - page 16 / 21
» A Case for Simple SAT Solvers
Sort
View
ICCAD
1997
IEEE
122views Hardware» more  ICCAD 1997»
13 years 11 months ago
Approximate timing analysis of combinational circuits under the XBD0 model
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
Yuji Kukimoto, Wilsin Gosti, Alexander Saldanha, R...
CSCLP
2007
Springer
14 years 1 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
CEC
2009
IEEE
13 years 11 months ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger
LPAR
2010
Springer
13 years 5 months ago
Semiring-Induced Propositional Logic: Definition and Basic Algorithms
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
Javier Larrosa, Albert Oliveras, Enric Rodrí...
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 27 days ago
Half-GCD and fast rational recovery
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
Daniel Lichtblau