Results 221 to 230 of about 91,855 (262)
Some of the next articles are maybe not open access.
Spanning tree approach in all-terminal network reliability expansion
Computer Communications, 2001A method is presented to maximize the reliability improvement of a communication network through a new edge addition between an existing node pair of the network. The method does not require the numerical reliability functions for determining such a node pair.
Nasser S. Fard, Taehan Lee
openaire +1 more source
Cumulative Update of All-Terminal Reliability for Faster Feasibility Decision
IEEE Transactions on Reliability, 2010Designing a reliable network becomes a time-consuming task if it involves All-Terminal Reliability (ATR) calculation, which belongs to the class of NP-hard problems. To make this task easier to address, we propose a new algorithm to decide the ATR feasibility of a given network G without performing exhaustive calculation.
Jin-Myung Won, Fakhri Karray
openaire +1 more source
Estimating all-terminal network reliability using a neural network
SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), 2002The exact calculation of all-terminal network reliability is an NP-hard problem, with computational effort growing exponentially with the number of nodes and links in the network. Due to the impracticality of calculating all-terminal network reliability for networks of moderate to large size, Monte Carlo simulation methods have been used to estimate ...
Chat Srivaree-ratana, Alice E. Smith
openaire +1 more source
All-terminal hypernetwork reliability synthesis of a kind of semi-deterministic hypergraphs
International Journal of Modern Physics C, 2021Network reliability plays an important role in analysis, synthesis and detection of real-world networks. In this paper, we first propose the concept of hypernetwork reliability, which generalizes the concept of network reliability. The model for hypernetwork reliability studies consists of a hypergraph with perfect reliable vertices and equal and ...
Ke Zhang +4 more
openaire +1 more source
All-Terminal Network Reliability Using Recursive Truncation Algorithm
IEEE Transactions on Reliability, 2009Exact calculation of all-terminal network reliability is a hard problem; its computational complexity grows exponentially with the number of nodes and links in the network. We propose the Recursive Truncation Algorithm (RTA), a bounding approximation algorithm, to estimate the all-terminal reliability of a given network with a pre-specified accuracy ...
Ahmad R. Sharafat, Omid Reza Ma'rouzi
openaire +1 more source
Bounds for All-Terminal Reliability in Planar Networks
1987A communication network can be modeled as a graph where the nodes of the graph represent the sites, and the edges represent the links between the sites. The edges of the graph operate with equal probability p . The all-terminal reliability of the network with n nodes and b edges can be written as where F i is the number of connected subgraphs ...
Aparna Ramesh +2 more
openaire +1 more source
Estimation of all-terminal network reliability using an artificial neural network
Computers & Operations Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chat Srivaree-ratana +2 more
openaire +1 more source
All-terminal network reliability estimation using convolutional neural networks
Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, 2020Estimating the all-terminal network reliability by using artificial neural networks (ANNs) has emerged as a promissory alternative to classical exact NP-hard algorithms. Approaches based on traditional ANNs have usually considered the network reliability upper bound as part of the inputs, which implies additional time-consuming calculations during both
Alex Davila-Frias, Om Prakash Yadav
openaire +1 more source
A Greedy Algorithm for Faster Feasibility Evaluation of All-Terminal-Reliable Networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2011Although calculating the all-terminal reliability (ATR) of a stochastic network is a computationally expensive task, deciding whether the ATR is greater than a preset value could be done with less effort. This study proposes a new method that generates the sequential lower and upper bounds of the ATR, based on greedy network factoring.
Jin-Myung Won, Fakhreddine Karray
openaire +2 more sources
Heuristic optimization of network design considering all-terminal reliability
Annual Reliability and Maintainability Symposium, 2002This paper describes a heuristic optimization approach using genetic algorithms. The method solves general network design problems to optimality, or near-optimality, with respect to reliability. The optimization formulation in this paper relaxes the previous restrictions that appear in the literature.
D.L. Deeter, A.E. Smith
openaire +1 more source