1278 search results - page 62 / 256 » The Complexity of Weighted Boolean |
167
click to vote
ECCC
2011
14 years 10 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
126
click to vote
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
155
Voted
FOSSACS
2007
Springer
15 years 7 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
158
Voted
ALT
2010
Springer
15 years 3 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
114
Voted
ICCAD
2005
IEEE
16 years 10 days ago
2005
IEEE
Abstract — This paper describes a practical technique for the optimal scheduling of control dominated systems minimizing the weighted average latency over all control branches. S...