738 search results - page 10 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
ICDM
2003
IEEE
2003
IEEE
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
15 years 2 months ago
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
76
Voted
ECAI
2004
Springer
15 years 1 months ago
2004
Springer
In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, w...
SIGCOMM
2004
ACM
15 years 3 months ago
2004
ACM
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
CAV
2012
Springer
13 years 2 days ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
ECAI
2000
Springer
15 years 2 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...