Details
| Original language | English |
|---|---|
| Title of host publication | 2015 IEEE International Conference on Systems, Man, and Cybernetics |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1657-1663 |
| Number of pages | 7 |
| ISBN (electronic) | 9781479986965, 9781479986972 |
| Publication status | Published - 2015 |
| Event | IEEE International Conference on Systems, Man, and Cybernetics - Kowloon Tong, Hong Kong Duration: 9 Oct 2015 → 12 Oct 2015 |
Abstract
In this study several algorithms for the generation of inexpensive and fault-Tolerant graphs are evaluated with respect to the quality of the found graphs and to the runtime requirements. A special focus lies on the properties of the algorithm that basically is a simulation of the foraging of the slime mold Physarum polycephalum, since in many other works the deployment of this algorithm does not go beyond the conclusion, that the algorithm is capable to generate a graph, while quality of the graph and runtime requirements of the algorithm are not reported. Our results show that the slime mold algorithm has some interesting features, however it is not the best means to construct highly efficient graphs out of large sets of nodes.
ASJC Scopus subject areas
- Computer Science(all)
- Artificial Intelligence
- Computer Science(all)
- Computer Networks and Communications
- Energy(all)
- Energy Engineering and Power Technology
- Decision Sciences(all)
- Information Systems and Management
- Engineering(all)
- Control and Systems Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
2015 IEEE International Conference on Systems, Man, and Cybernetics. Institute of Electrical and Electronics Engineers Inc., 2015. p. 1657-1663 7379424.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - On the Efficiency of Nature-Inspired Algorithms for Generation of Fault-Tolerant Graphs
AU - Becker, Matthias
PY - 2015
Y1 - 2015
N2 - In this study several algorithms for the generation of inexpensive and fault-Tolerant graphs are evaluated with respect to the quality of the found graphs and to the runtime requirements. A special focus lies on the properties of the algorithm that basically is a simulation of the foraging of the slime mold Physarum polycephalum, since in many other works the deployment of this algorithm does not go beyond the conclusion, that the algorithm is capable to generate a graph, while quality of the graph and runtime requirements of the algorithm are not reported. Our results show that the slime mold algorithm has some interesting features, however it is not the best means to construct highly efficient graphs out of large sets of nodes.
AB - In this study several algorithms for the generation of inexpensive and fault-Tolerant graphs are evaluated with respect to the quality of the found graphs and to the runtime requirements. A special focus lies on the properties of the algorithm that basically is a simulation of the foraging of the slime mold Physarum polycephalum, since in many other works the deployment of this algorithm does not go beyond the conclusion, that the algorithm is capable to generate a graph, while quality of the graph and runtime requirements of the algorithm are not reported. Our results show that the slime mold algorithm has some interesting features, however it is not the best means to construct highly efficient graphs out of large sets of nodes.
UR - http://www.scopus.com/inward/record.url?scp=84964456753&partnerID=8YFLogxK
U2 - 10.1109/SMC.2015.292
DO - 10.1109/SMC.2015.292
M3 - Conference contribution
AN - SCOPUS:84964456753
SP - 1657
EP - 1663
BT - 2015 IEEE International Conference on Systems, Man, and Cybernetics
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Conference on Systems, Man, and Cybernetics
Y2 - 9 October 2015 through 12 October 2015
ER -