Sciweavers

613 search results - page 20 / 123
» Finding and Fixing Faults
Sort
View
DSN
2004
IEEE
15 years 1 months ago
Automated Synthesis of Multitolerance
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...
Sandeep S. Kulkarni, Ali Ebnenasir
HASE
1996
IEEE
15 years 1 months ago
Adaptive recovery for mobile environments
Mobile computing allows ubiquitous and continuousaccess to computing resources while the users travel or work at a client's site. The flexibility introduced by mobile computi...
Nuno Neves, W. Kent Fuchs
DM
2000
73views more  DM 2000»
14 years 9 months ago
Some formulae for partitions into squares
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...
Michael D. Hirschhorn
69
Voted
MOC
2000
77views more  MOC 2000»
14 years 9 months ago
Isomorphisms between Artin-Schreier towers
We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree pn over ...
Jean Marc Couveignes
78
Voted
ITC
1996
IEEE
127views Hardware» more  ITC 1996»
15 years 1 months ago
Altering a Pseudo-Random Bit Sequence for Scan-Based BIST
This paper presents a low-overhead scheme for built-in self-test of circuits with scan. Complete (100%) fault coverage is obtained without modifying the function logic and without...
Nur A. Touba, Edward J. McCluskey