NEW ANALYSIS TECHNIQUE FOR PROBABILISTIC GRAPHS

被引：69

作者：

DOTSON, WP ^{[1
]}

GOBIEN, JO ^{[1
]}

机构：

[1] USAF,ROME AIR DEV CTR,LOCAT & CONTROL BRANCH,COMM ECCM TECHN SECT,GRIFFISS AFB,NY 13441

来源：

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS | 1979年 / 26卷 / 10期

关键词：

D O I：

10.1109/TCS.1979.1084573

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A new technique for determining the terminal reliability of probabilistic networks is derived and discussed. The technique uses set-the-oretic concepts to partition the space of all graph realizations in a way which permits extremely fast evaluation of the source-to-terminal probability. If not allowed to run to completion, the algorithm yields rapidly converging upper and lower bounds on that probability. Comparison with algorithms in the recent literature shows a decrease of one or two orders of magnitude in required CPU time. © 1979 IEEE

引用

页码：855 / 865

页数：11