613 search results - page 46 / 123 » Finding and Fixing Faults |
125
click to vote
ALGORITHMICA
2010
14 years 10 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
CODES
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper we present an approach to the scheduling and voltage scaling of low-power fault-tolerant hard real-time applications mapped on distributed heterogeneous embedded sys...
114
click to vote
CODES
2010
IEEE
14 years 8 months ago
2010
IEEE
This paper presents an approach to system-level optimization of error detection implementation in the context of fault-tolerant realtime distributed embedded systems used for safe...
106
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
IOLTS
2009
IEEE
15 years 6 months ago
2009
IEEE
The amount of physical variation among electronic components on a die is increasing rapidly. There is a need for a better understanding of variations in transient fault susceptibil...