Results 241 to 250 of about 14,483,123 (286)
Some of the next articles are maybe not open access.
Estimation of all-terminal network reliability using an artificial neural network
Computers and Operations Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdullah Konak, Alice E Smith
exaly +2 more sources
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 Sharafat
exaly +2 more sources
All-terminal network reliability optimization via probabilistic solution discovery
Reliability Engineering and System Safety, 2008This paper presents a new algorithm that can be readily applied to solve the all-terminal network reliability allocation problems. The optimization problem solved considers the minimization of the network design cost subject to a known constraint on all-terminal reliability by assuming that the network contains a known number of functionally equivalent
JOSÉ Emmanuel Ramirez Marquez +1 more
exaly +2 more sources
On Parallel Calculation of All-Terminal Network Reliability
2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems (OPCS), 2021The paper presents parallel algorithms for calculating the exact value of all-terminal reliability of a network with unreliable edges and absolutely reliable nodes. A random graph is used as a model of such network. The algorithms are based on the factorization procedure which is a well-known sequential method of a reliability calculation ...
Kirill Sergeev, Denis Migov
openaire +1 more source
Sufficient conditions for log-concave conjecture on all-terminal reliability polynomial of a network [PDF]
名古屋学院大学研究年報, 2020 Consider a graph G that is simple, undirected, and connected, and has n vertices and m edges, and let Ni(G) denote the number of connected spanning i-edge-subgraphs in a graph G for an integer i(n－1■i■m). For a graph G and all integers i ’s (n■i■m－1), it
Cheng, Peng
openaire +4 more sources
Bounding all‐terminal reliability in computer networks
Networks, 1988AbstractMany bounds for the all‐terminal reliability of computer networks have been proposed. Of those computable in polynomial time, the Ball‐Provan bounds and the Lomonosov Polesskii bounds provide the tightest estimates. A strategy is developed here using linear programming to obtain bounds which are tighter than both the Lomonosov‐Polesskii and the
Charles J. Colbourn, Daryl D. Harms
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
Simulation of all-terminal reliability of an undirected network using the reliability polynomial
2020 28th Telecommunications Forum (TELFOR), 2020This paper discusses the modeling of terminal network reliability using reliability polynomials. A simulator was developed and its results compared with the values of the reliability polynomial. The lack of exact methods for calculating reliability polynomials is considered and an approximate method for calculating reliability polynomials covering the ...
Aleksandar Paripović +2 more
openaire +1 more source
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