738 search results - page 131 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
118
click to vote
CODES
2003
IEEE
15 years 2 months ago
2003
IEEE
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
120
click to vote
TSE
2011
14 years 4 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
RTAS
1999
IEEE
15 years 1 months ago
1999
IEEE
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality prefer...
102
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
165
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...