Wonder Club world wonders pyramid logo
×

Network reliability Book

Network reliability
Network reliability, Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It desc, Network reliability has a rating of 3.5 stars
   2 Ratings
X
Network reliability, Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It desc, Network reliability
3.5 out of 5 stars based on 2 reviews
5
0 %
4
50 %
3
50 %
2
0 %
1
0 %
Digital Copy
PDF format
1 available   for $99.99
Original Magazine
Physical Format

Sold Out

  • Network reliability
  • Written by author Daryl D Harms,Miroslav Kraetzl,Charles J. Colbourn,Stanley J. Devitt
  • Published by Boca Raton, FL : CRC Press, c1995., 1995/06/16
  • Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It desc
Buy Digital  USD$99.99

WonderClub View Cart Button

WonderClub Add to Inventory Button
WonderClub Add to Wishlist Button
WonderClub Add to Collection Button

Book Categories

Authors

BLOCKING PROPERTIES OF CHANNEL GRAPHS Introduction for Channel Graphs Motivation Summary and Overview Background for Channel Graphs Channel Graphs Optimal Channel Graphs Reliability Polynomial and Kruskal-Katona Bounds Consecutive Minimal Cutsets The Esary-Proschan Upper Bound Reachability Monte Carlo Methods Transformations on Channel Graphs The Swap Transformation An Application to Takagi's and Chung and Hwang's Result Insplit and Outsplit Transformation Renormalization Threshold Channel Graphs Shifting for Threshold Channel Graphs Least Reliable Threshold Channel Graph Most Reliable Threshold Channel Graph Shifting in Many Stages and a Lower Bound Different Operational Probabilities The Averaging Transformation Subgraph Counting Bounds Improving the Kruskal-Katona Bounds Lower Bounds on the Coefficients Upper Bounds on the Coefficients Test Results An Empirical Evaluation Interconnection Networks Conclusions for Channel Graphs Summary of Contributions Directions for Future Work A SYSTEM FOR TWO-TERMINAL RELIABILITY Introduction for Two-Terminal Reliability Overview of the Part Two-Terminal Reliability Network Model Graph Theoretic Definitions Existing Connectivity Algorithms Performability New or Improved Methods The Renormalization Method Coefficient-Wise Bounds Consecutive Cuts Orderings Hybrid Methods for Performability The System Developed Requirements Development Decisions Pre-Existing System New Development Development Experience Using the Package as a Research Tool Test Results Test Network Topologies Performance of Upper Bounding Methods Performance of the Lower Bounding Methods Conclusions for Two-Terminal Reliability Summary Current (Ongoing) Research and System Development Future of the System APPENDICES Interactive Session Using the System Using the Networks Package Using the Reliability Package Using the Channel Package Performance of the Connectivity Bounds Absolute Performance Versus Exact Values Relative Performance of Upper Bounds Interpolating Reliability Polynomials Bibliography


Login

  |  

Complaints

  |  

Blog

  |  

Games

  |  

Digital Media

  |  

Souls

  |  

Obituary

  |  

Contact Us

  |  

FAQ

CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!!

X
WonderClub Home

This item is in your Wish List

Network reliability, Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It desc, Network reliability

X
WonderClub Home

This item is in your Collection

Network reliability, Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It desc, Network reliability

Network reliability

X
WonderClub Home

This Item is in Your Inventory

Network reliability, Network Reliability: Experiments with a Symbolic Algebra Environment examines two intertwined topics: computational methods for computing bounds on three measures of network reliability, and a symbolic algebra system to support these computations. It desc, Network reliability

Network reliability

WonderClub Home

You must be logged in to review the products

E-mail address:

Password: