Sciweavers

4940 search results - page 769 / 988
» On the Complexity of Universal Programs
Sort
View
CI
2000
114views more  CI 2000»
15 years 6 months ago
A Guided Tour through Some Extensions of the Event Calculus
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 prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
JPDC
2000
141views more  JPDC 2000»
15 years 6 months ago
A System for Evaluating Performance and Cost of SIMD Array Designs
: SIMD arrays are likely to become increasingly important as coprocessors in domain specific systems as architects continue to leverage RAM technology in their design. The problem ...
Martin C. Herbordt, Jade Cravy, Renoy Sam, Owais K...
ASPLOS
2012
ACM
14 years 2 months ago
Understanding modern device drivers
Device drivers are the single largest contributor to operating-system kernel code with over 5 million lines of code in the Linux kernel, and cause significant complexity, bugs an...
Asim Kadav, Michael M. Swift
IHI
2012
217views Healthcare» more  IHI 2012»
14 years 2 months ago
Declarative privacy policy: finite models and attribute-based encryption
Regulations and policies regarding Electronic Health Information (EHI) are increasingly complex. Federal and State policy makers have called for both education to increase stakeho...
Peifung E. Lam, John C. Mitchell, Andre Scedrov, S...
PLDI
2012
ACM
13 years 9 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa