Sciweavers

1169 search results - page 55 / 234
» Degrees of monotone complexity
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi
RTS
2010
134views more  RTS 2010»
13 years 7 months ago
Improved multiprocessor global schedulability analysis
A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) ...
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto March...
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
14 years 9 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
QEST
2008
IEEE
14 years 3 months ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...
SAT
2005
Springer
145views Hardware» more  SAT 2005»
14 years 2 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman