2022 search results - page 288 / 405 » Complexity of Non-Monotonic Logics |
157
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
The fine-grained parallelism inherent in FPGAs has encouraged their use in packet processing systems. Debugging and performance evaluation of such complex designs can be signifi...
156
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—High computational effort in modern image processing applications like medical imaging or high-resolution video processing often demands for massively parallel special p...
167
click to vote
CCS
2007
ACM
16 years 16 days ago
2007
ACM
Security automata are a variant of B¨uchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, ...
190
click to vote
CONCUR
2007
Springer
16 years 16 days ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
149
click to vote
ER
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...