26 search results - page 5 / 6 » Matched Formulas and Backdoor Sets |
SIGMETRICS
2010
ACM
13 years 10 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
GLOBECOM
2007
IEEE
14 years 2 days ago
2007
IEEE
— We propose a contention based reservation MAC protocol for a collaborative sensing scenario involving a set of surveillance UAVs communicating with a hub. Data transmission rig...
AAAI
1993
13 years 7 months ago
1993
Formal AI systems traditionally represent knowledge using logical formulas. We will show, however, that for certain kinds of information, a modelbased representation is more compa...
CSL
2007
Springer
13 years 12 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
CADE
2009
Springer
14 years 16 days ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...