323 search results - page 35 / 65 » The Fault Tolerance of NP-Hard Problems |
173
click to vote
DAC
2003
ACM
15 years 11 months ago
2003
ACM
To improve the system performance, designs with multiple clocks have become more and more popular. In this paper, several novel test generation procedures are proposed to utilize ...
145
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
156
click to vote
FUIN
2000
15 years 6 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
156
click to vote
PARA
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. This paper describe the implementation and underlying philosophie of a large scale distributed computation of K-optimal lattice rules. The computation is huge correspondi...
170
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...