Quanterion IT Solutions
Cart is emptyRetrieve a Cart
Quanterion Solutions IncorporatedThursday, May 23, 2013 
   Quanterion Home   Products   Solutions   Training   Publications   Downloads   About Quanterion
Quick Links
 Software Tools
   • Quanterion Automated
     Reliability Toolkit (QuART)

   • REPERTOIRE
   • 217Plus
   • Reliability Self-Assessment
     Tool (RASTER)

 Knowledge Sources
   • Cyber Security and
     Information Systems Information
     Analysis Center (CSIAC)

   • Reliability Information
     Analysis Center (RIAC)

   • Reliability Toolkits
   • Reliability Ques
   • Training
 FREE Resources
   • Quanterion RMQ Brochure [pdf]
   • QuART Demo
   • Mil Stds/Hdbks
   • MIL-HDBK-217
   • FAA-HDBK-006A
   • Lunchtime Learning
   • Recommended Texts
   • RMQ Links
   • Reliability Self-assessment
   • "QuICKER" Online Training
 Quanterion
   • How We Can Help
   • Contract Vehicles
   • Experience
   • Doing Business
   • How To Find Us
   • Contact




 811 Court Street
 Utica NY 13502-4096
 Phone: 315.732.0097
 Toll free: 877.808.0097
 FAX: 315.732.3261
 qinfo@quanterion.com
   Quanterion Virtual Bookstore
 


Virtual Bookstore Citation
Title
ESTIMATING NETWORK RELIABILITY WITH ACCELERATED CONVERGENCE RATES ON ERROR BOUNDS.

Author(s)
Fishman,G. S. ;

Corporate Author(s)
NORTH CAROLINA UNIV AT CHAPEL HILL CURRICULUM IN OPERATIONS RESEARCH AND SYSTEMS ANALYSIS

Report Date
12/1/1983

Page Count
38

Abstract
The purpose of this paper is to describe related estimation techniquesthat improve the convergence rate to 1/K when a specified nonrandom finitesequence of sample points is used and to (log K)/K when certain nonrandominfinite sequences of sample points are used. In addition, algorithms are givenfor computing estimates of g(s,t) with 1/K and (log K)/K convergence rates withcomputation time complexities per replication having an upper bound O(N) +o(max(N,/V/)) as K approaches limit of infinity. Although the infinite sequenceshave a slower convergence rate than the finite sequence has, these offer theconvenience of allowing one to add replications as desired and retaining therate. By contrast, the finite sequence does not allow this addition, once K isinitially fixed.

Price: Available from National Technical Information Service (NTIS). http://www.ntis.gov
 


Prices are plus sales tax when purchased within New York State and shipping charges, if applicable

Copyright © 2000-2013 Quanterion Solutions Incorporated
This site is best viewed in IE 8.0 or higher, Firefox 3.0 or higher, and Google Chrome.

View Table of Contents Pages1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82