8094 search results - page 48 / 1619 » Improvements in Formula Generalization |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Focusing bistatic SAR data in frequency domain requires the two dimensional (2D) point target reference spectrum (PTRS). In this paper, a 2D PTRS is derived based on Loffeld’s b...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show tha...
DAC
2002
ACM
14 years 8 months ago
2002
ACM
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
DNA
2001
Springer
14 years 7 days ago
2001
Springer
A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This re...