Network Reliability: Experiments With A Symbolic Algebra Environment (Discrete Mathematics And Its Applications)
SKU: DADAX0849339804
ISBN : 9780849339806
Condition : New
Shipping & Tax will be calculated at Checkout.
Estimated delivery time 7-14 days.
International delivery time 2 to 4 weeks.
Network Reliability: Experiments with a Symbolic Algebra Environment (Discrete Mathematics and Its Applications)
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 describes, in algorithmic outlines, efficient techniques for reliability bounds and discusses the implementation of the techniques. It explores all-terminal reliability, two-terminal reliability, and reliability of interconnection networks. Consistent with real-world experience, the computational environment and results are strongly supported by sound theoretical development.
Specification of Network Reliability: Experiments with a Symbolic Algebra Environment (Discrete Mathematics and Its Applications)
GENERAL | |
---|---|
Author | Daryl D Harms |
Binding | Hardcover |
Language | English |
Edition | 1 |
ISBN-10 | 0849339804 |
ISBN-13 | 9780849339806 |
Publisher | CRC Press |
Publication Year | 1995 |
DIMENSIONS | |
---|---|
Height | 7.5 inch. |
Length | 0.75 inch. |
Width | 10.5 inch. |
Weight | 1.42 pounds. |
Write a review
Your Name:
Your Email:
Your Review:
Note: HTML is not translated!
Rating: Bad Good
Enter the code in the box below: