登入選單

返回Google圖書搜尋

Monte-Carlo Methods for Estimating System Reliability

Michael George Luby

出版	University of California, Berkeley., 1983
URL	http://books.google.com.hk/books?id=PHhJAQAAMAAJ&hl=&source=gbs_api

註釋

The second format for the representation of F can be described as follows. A network is an undirected graph G, where the edges in the graph correspond to the components in the system. Let G be a planar network and let x1 ..., xK be K specified nodes in G. For the planar K-terminal problem, the network is in a failing state if there is no path of working edges between some pair of specified nodes. We develop a Monte Carlo algorithm to estimate Pr[F] for the planar K-terminal problem. The algorithm works especially well when the edge failure probabilities are small. In this case the algorithm produces an estimator Y which is probably close to Pr[F] with high probability in time polynomial in the size of the graph. This compares very favorably with the execution times of other methods used for solving this problem.