http://www.cnr.it/ontology/cnr/individuo/prodotto/ID44091
A New Diagnosis Algorithm for Regular Interconnected Structures (Articolo in rivista)
- Type
- Label
- A New Diagnosis Algorithm for Regular Interconnected Structures (Articolo in rivista) (literal)
- Anno
- 2003-01-01T00:00:00+01:00 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Caruso A., Albini L., Maestrini P. (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
- In: First Latin American Symposium (Sao Paulo, Brasil, October 2003). Proceedings, pp. 263 - 281. Rogerio de Lemos et al. (eds.). (Lecture Notes in Computer Science, vol. 2847). Springler, 2003. (literal)
- Note
- ISI Web of Science (WOS) (literal)
- Titolo
- A New Diagnosis Algorithm for Regular Interconnected Structures (literal)
- Abstract
- We present a new diagnosis algorithm (NDA) for regular interconnected structures. The diagnosis algorithm has time complexity $O(kn)$ when applied to $k$-regular systems of $n$ units. It provides a correct diagnosis, although incomplete. The diagnosis is correct if the number of faulty units is not above a specified bound $T_sigma$, asserted by the algorithm itself. The correctness and completeness of ALG is studied through simulations on toroidal grids and hypercubes. Simulation results show that ALG provides a correct diagnosis even when the number of faults is very high (near half of the system size). The comparison between algorithm ALG and other diagnostic algorithms shows that ALG provides a better diagnosis, i.e., it has an higher degree of completeness than other diagnostic algorithms. (literal)
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Prodotto
- Autore CNR di
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
- Insieme di parole chiave di
