56 search results - page 7 / 12 » Fault Tolerant Boolean Satisfiability |
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— The constructions of optical buffers is one of the most critically sought after optical technologies in all-optical packet-switched networks, and constructing optical buffers d...
ICFEM
2009
Springer
13 years 5 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
AICCSA
2006
IEEE
13 years 9 months ago
2006
IEEE
To excite a stuck-open fault in a CMOS combinational circuit, it is only necessary that the output of the gate containing the fault takes on opposite values during the application...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
DSN
2004
IEEE
13 years 11 months ago
2004
IEEE
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...