8094 search results - page 147 / 1619 » Improvements in Formula Generalization |
ASPDAC
2000
ACM
14 years 26 days ago
2000
ACM
We present a satisfiability based multi-clock path analysis method. The method uses propositional satisfiability (SAT) in the detection of multi-clock paths. We show a method to re...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
TREC
2008
13 years 10 months ago
2008
This paper details our experiments carried out at TREC 2008 Relevance Feedback Track. We focused on the analysis of feedback documents, both relevant and non-relevant, to explore ...
DEXA
2010
Springer
13 years 9 months ago
2010
Springer
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Refactoring is a change made to the internal structure of software to make it easier to understand and cheaper to modify without changing its observable behaviour. A database refa...