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
β¦ LIBER β¦
A new methodology for the design and the analysis of a class of interconnection networks
β Scribed by Seyed-Ali Ghozati
- Book ID
- 113212081
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 775 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0045-7906
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A new class of interconnection networks
β
Jung-Sing Jwo; S. Lakshmivarahan; S. K. Dhall
π
Article
π
1993
π
John Wiley and Sons
π
English
β 724 KB
Robustness analysis and design of a clas
β
Derong Liu; Anthony N. Michel
π
Article
π
1996
π
Elsevier Science
π
English
β 996 KB
A methodology for the simultaneous desig
β
Haihua Su; Jiang Hu; Sapatnekar, S.S.; Nassif, S.R.
π
Article
π
2004
π
IEEE
π
English
β 760 KB
A Class of Arc-Transitive Cayley Graphs
β
Zhou, Sanming
π
Article
π
2009
π
Society for Industrial and Applied Mathematics
π
English
β 356 KB
On the design of a class of neural netwo
β
David V. SΓ‘nchez A.
π
Article
π
1996
π
Elsevier Science
π
English
β 196 KB
The design of the class of RBF networks is described. These three-layer networks possess the universal and best approximation capability in the framework of supervised learning of real functions of real vectors from examples and offer a large amount of applications. A learning method is described fo
A Simple Methodology for the Design of W
β
S.G. Olesen; G.T. Polley
π
Article
π
1997
π
Institution of Chemical Engineers
π
English
β 223 KB