IEEE Transactions on Computers - The MIT Press scientific computation series
Diagnosis in hybrid fault situations under AIM and a unified t-characterization
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms
Improved Diagnosability Algorithms
IEEE Transactions on Computers
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
| Hi-index | 14.98 |
Prior research has extended the classical PMC (or Symmetric Invalidation) Model to incorporate a priori weights or probabilities associated with units. We consider a similar extension to the BGM (or Asymmetric Invalidation) Model. In contrast to the PMC model, where deciding the weighted diagnosability number is co-NP complete, we show that the diagnosability number in the weighted BGM model can be obtained in O(m2) time, where m is the number of tests in the system. We also show that diagnosis in this weighted model can be performed in O(T(n)) time, where n is the number of units in the system and $T(n) \approx n^{2.376}$ is the amount of time needed to multiply two n by n matrices.