Sciweavers

612 search results - page 61 / 123
» Bounded model checking for knowledge and real time
Sort
View
RTAS
2005
IEEE
15 years 3 months ago
On Schedulability Bounds of Static Priority Schedulers
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 3 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
STACS
1999
Springer
15 years 2 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
SIGADA
2005
Springer
15 years 3 months ago
Temporal skeletons for verifying time
This paper presents an intermediate notation used in a framework for verification of real-time properties. The framework aims at overcoming the need for the framework user to hav...
Gustaf Naeser, Kristina Lundqvist, Lars Asplund
SIGMOD
2012
ACM
223views Database» more  SIGMOD 2012»
13 years 7 days ago
MaskIt: privately releasing user context streams for personalized mobile applications
The rise of smartphones equipped with various sensors has enabled personalization of various applications based on user contexts extracted from sensor readings. At the same time i...
Michaela Götz, Suman Nath, Johannes Gehrke