264 search results - page 6 / 53 » On the possibility of faster SAT algorithms |
DAC
2005
ACM
15 years 17 hour ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
104
click to vote
JAR
2006
14 years 10 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
HVC
2005
Springer
15 years 3 months ago
2005
Springer
We present several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties. More precisely, we focus on Bounded Model Checking and ...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set...
101
click to vote
ICTAI
2002
IEEE
15 years 3 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...