Cooperative Cross-Entropy method for generating entangled networks.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 65181316 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Cooperative Cross-Entropy method for generating entangled networks. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Hui%2C+Kin-Ping%22">Hui, Kin-Ping</searchLink><relatesTo>1</relatesTo><i> Kin-Ping.Hui@dsto.defence.gov.au</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>. Sep2011, Vol. 189 Issue 1, p205-214. 10p. 6 Diagrams, 2 Charts, 3 Graphs. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computer+network+design+%26+construction%22">Computer network design & construction</searchLink><br /><searchLink fieldCode="DE" term="%22Cross-entropy+method%22">Cross-entropy method</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+algorithms%22">Graph algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Genetic+algorithms%22">Genetic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Eigenvalues%22">Eigenvalues</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=65181316 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10479-009-0589-1 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 10 StartPage: 205 Subjects: – SubjectFull: Computer network design & construction Type: general – SubjectFull: Cross-entropy method Type: general – SubjectFull: Graph algorithms Type: general – SubjectFull: Genetic algorithms Type: general – SubjectFull: Eigenvalues Type: general Titles: – TitleFull: Cooperative Cross-Entropy method for generating entangled networks. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Hui, Kin-Ping IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2011 Type: published Y: 2011 Identifiers: – Type: issn-print Value: 02545330 Numbering: – Type: volume Value: 189 – Type: issue Value: 1 Titles: – TitleFull: Annals of Operations Research Type: main |
| ResultId | 1 |
