846 search results - page 100 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
149
click to vote
FPGA
2004
ACM
15 years 11 months ago
2004
ACM
This paper shows a method to verifying the thermal status of complex FPGA-based circuits like microprocessors. Thus, the designer can evaluate if a particular block is working bey...
143
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
205
click to vote
JELIA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
146
click to vote
ICPR
2008
IEEE
16 years 19 days ago
2008
IEEE
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
176
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....