Pages that link to "Item:Q3738890"
From MaRDI portal
The following pages link to Computational Complexity of Network Reliability Analysis: An Overview (Q3738890):
Displayed 30 items.
- Fast computation of bounds for two-terminal network reliability (Q296891) (← links)
- Double resource optimization for a robust computer network subject to a transmission budget (Q331840) (← links)
- The value of information in stochastic maximum flow problems (Q336360) (← links)
- An adaptive zero-variance importance sampling approximation for static network dependability evaluation (Q336964) (← links)
- Linguistic performance evaluation for an ERP system with link failures (Q506309) (← links)
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique (Q636690) (← links)
- Reliability evaluation of multi-state systems under cost consideration (Q693557) (← links)
- Algorithms for the determination of cutsets in a hypergraph (Q805260) (← links)
- A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems (Q1130399) (← links)
- Generating the states of a binary stochastic system (Q1199451) (← links)
- Design of reliable networks (Q1201852) (← links)
- The expected number of pairs of connected nodes: Pair-connected reliability (Q1310221) (← links)
- Optimal coteries and voting schemes (Q1328755) (← links)
- Reliability analysis of a simple replicated and-fork/and-join graph (Q1342096) (← links)
- Terminal-pair reliability in ATM virtual path networks (Q1591928) (← links)
- A new simulation method based on the RVR principle for the rare event network reliability problem (Q1761802) (← links)
- A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs (Q1842649) (← links)
- Two-commodity reliability evaluation for a stochastic-flow network with node failure (Q1941962) (← links)
- Optimal double-resource assignment for a distributed multistate network (Q2351293) (← links)
- Practical sequential bounds for approximating two-terminal reliability (Q2378344) (← links)
- An algorithm to compute the all-terminal reliability measure. (Q2467843) (← links)
- An Approximate Algorithm for the Robust Design in a Stochastic-Flow Network (Q2786232) (← links)
- Full complexity analysis of the diameter-constrained reliability (Q2806430) (← links)
- Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
- A combined decomposition-reduction approach to the <i>K</i>-terminal reliability of. stochastic networks (Q3204305) (← links)
- Interactive Reliability Analysis on a Microcomputer (Q3350597) (← links)
- Power Indices in Spanning Connectivity Games (Q3638444) (← links)
- Balanced and Approximate Zero-Variance Recursive Estimators for the Network Reliability Problem (Q5270728) (← links)
- An Improvement to the Total Hazard Method for System Reliability Simulation (Q5485362) (← links)
- Search for MC in modified networks (Q5926035) (← links)