Wide attention was recently given to the problem of fault-tolerance in neural networks; while most authors dealt with aspects related to specific VLSI implementations, attention was also given to the intrinsic capacity of survival to faults characterizing the neural modes. The present paper tackles
โฆ LIBER โฆ
Fault tolerance analysis of the class of rearrangeable interconnection networks
โ Scribed by S. Pakzad
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 356 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Analysis of Fault Tolerance in Artificia
โ
Vincenzo Piuri
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 513 KB
Stochastic analysis of a fault tolerant
โ
L.R. Goel; Rakesh Gupta; V.S. Rana
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 186 KB
Performance and dependability analysis o
โ
A. Brenner
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 786 KB
Reliability analysis of fault tolerant p
โ
Fabrizio Lombardi
๐
Article
๐
1983
๐
Elsevier Science
๐
English
โ 305 KB
On fault-tolerant embedding of Hamiltoni
โ
Suresh Viswanathan; รva Czabarka; Abhijit Sengupta
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 715 KB
A new class of interconnection networks
โ
Jung-Sing Jwo; S. Lakshmivarahan; S. K. Dhall
๐
Article
๐
1993
๐
John Wiley and Sons
๐
English
โ 724 KB
This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltoni