Sciweavers

4257 search results - page 829 / 852
» The Logical Modularity of Programs
Sort
View
CF
2010
ACM
14 years 3 months ago
Interval-based models for run-time DVFS orchestration in superscalar processors
We develop two simple interval-based models for dynamic superscalar processors. These models allow us to: i) predict with great accuracy performance and power consumption under va...
Georgios Keramidas, Vasileios Spiliopoulos, Stefan...
BIRTHDAY
2010
Springer
14 years 3 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
ICALP
1998
Springer
14 years 2 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
EDBT
1990
ACM
108views Database» more  EDBT 1990»
14 years 2 months ago
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
Carlo Zaniolo
ESWS
2010
Springer
14 years 2 months ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani