Results 261 to 270 of about 14,483,123 (286)
Some of the next articles are maybe not open access.
IEEE Transactions on Reliability, 1992
A graph is (K/sub 5/, K/sub 2.2.2/) free if it has no subgraph contractible to K/sub 5/ or K/sub 2.2.2/. The class of partial 3-trees (also known as Y- Delta graphs) is a proper subset of (K/sub 5/, K/sub 2.2.2/) free graphs. Let G be a network with perfectly reliable points and edges that fail independently with some known probabilities.
T. Politof, A. Satyanarayana, L. Tung
openaire +1 more source
A graph is (K/sub 5/, K/sub 2.2.2/) free if it has no subgraph contractible to K/sub 5/ or K/sub 2.2.2/. The class of partial 3-trees (also known as Y- Delta graphs) is a proper subset of (K/sub 5/, K/sub 2.2.2/) free graphs. Let G be a network with perfectly reliable points and edges that fail independently with some known probabilities.
T. Politof, A. Satyanarayana, L. Tung
openaire +1 more source
All-Terminal Network Reliability Estimation with Graph Neural Networks
2022 Annual Reliability and Maintainability Symposium (RAMS), 2022Alex Davila-Frias +3 more
openaire +1 more source
Deep Neural Networks for All-Terminal Network Reliability Estimation
2021 Annual Reliability and Maintainability Symposium (RAMS), 2021Alex Davila-Frias +2 more
openaire +1 more source
Proceedings of the 13th ACM Conference on Embedded Networked Sensor Systems, 2015
The reliability of the Internet of Things is critical because the services of it will be concerned with real life, although the low cost may limit the number of links of each computer. In this paper, we analyze the all-terminal reliability of wireless regular graphs of which the number of links of each node is bounded.
openaire +1 more source
The reliability of the Internet of Things is critical because the services of it will be concerned with real life, although the low cost may limit the number of links of each computer. In this paper, we analyze the all-terminal reliability of wireless regular graphs of which the number of links of each node is bounded.
openaire +1 more source
Implementing an approximation scheme for all terminal network reliability
1996Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996. ; Includes bibliographical references (leaf 50). ; by Ray P. Tai. ; M.Eng.
openaire +1 more source
Applying Machine Learning Methods to Improve All-Terminal Network Reliability
2023 Annual Reliability and Maintainability Symposium (RAMS), 2023José Azucena +3 more
openaire +1 more source
Maximizing k-Terminal Network Reliability in Some Sparse Graphs
IEEE/ACM Transactions on Networking, 2020Zuyuan Zhang +2 more
exaly
All-terminal network reliability estimation using convolutional neural networks
Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, 2022Alex Davila-Frias, Om Prakash Yadav
exaly