Sciweavers

77 search results - page 3 / 16
» Keeping Bits Safe: How Hard Can It Be
Sort
View
ANSOFT
1999
74views more  ANSOFT 1999»
13 years 7 months ago
On Coping with Real-Time Software Dynamic Inconsistency by Built-in Tests
In real-time systems, dynamic inconsistencies of software are hardly detected, diagnosed and handled. A built-in test (BIT) method is developed to cope with software dynamic incon...
Yingxu Wang, Graham King, Dilip Patel, Shushma Pat...
EMSOFT
2010
Springer
13 years 5 months ago
Resource adaptations with servers for hard real-time systems
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...
Nikolay Stoimenov, Lothar Thiele, Luca Santinelli,...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 11 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
FOCS
1995
IEEE
13 years 11 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
POPL
2005
ACM
14 years 8 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...