Bibliographic Details
| Title: |
Cooperative Cross-Entropy method for generating entangled networks. |
| Authors: |
Hui, Kin-Ping1 Kin-Ping.Hui@dsto.defence.gov.au |
| Source: |
Annals of Operations Research. Sep2011, Vol. 189 Issue 1, p205-214. 10p. 6 Diagrams, 2 Charts, 3 Graphs. |
| Subjects: |
Computer network design & construction, Cross-entropy method, Graph algorithms, Genetic algorithms, Eigenvalues |
| Abstract: |
Survivability is rapidly becoming an important criterion in network design and planning. This is due to our increased dependence on ever more complex communication networks. Another important criterion which plays a central role in design and planning decisions is cost. As a result, network planners tend to design sparse networks to minimise cost. There is a class of networks known as entangled networks which seems to satisfy both criteria of survivability and sparseness. In this paper, we demonstrate how the Cross-Entropy method may be utilised to generate entangled networks. We also propose a cooperative optimisation approach to further improve the generation of an optimal entangled network. [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
