一种新的网络概率连通性算法

MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341) Pub Date : 1999-10-31 DOI:10.1109/MILCOM.1999.821337

Yubin Chen, Jiandong Li, Jiamo Chen

{"title":"一种新的网络概率连通性算法","authors":"Yubin Chen, Jiandong Li, Jiamo Chen","doi":"10.1109/MILCOM.1999.821337","DOIUrl":null,"url":null,"abstract":"A new algorithm for network probabilistic connectivity is presented. In this algorithm, the multi-step decomposition algorithm of the network states space is given. A new method to construct sub-graphs for the obtained events is proposed, which can greatly reduce the dimensions of network states space. An iterative computation is used to approximate lower bound of the value of the probabilistic connectivity. Compared with other algorithms, ours is characterized by its fast computing and converging speed, and is most suitable for approximating computation.","PeriodicalId":334957,"journal":{"name":"MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A new algorithm for network probabilistic connectivity\",\"authors\":\"Yubin Chen, Jiandong Li, Jiamo Chen\",\"doi\":\"10.1109/MILCOM.1999.821337\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new algorithm for network probabilistic connectivity is presented. In this algorithm, the multi-step decomposition algorithm of the network states space is given. A new method to construct sub-graphs for the obtained events is proposed, which can greatly reduce the dimensions of network states space. An iterative computation is used to approximate lower bound of the value of the probabilistic connectivity. Compared with other algorithms, ours is characterized by its fast computing and converging speed, and is most suitable for approximating computation.\",\"PeriodicalId\":334957,\"journal\":{\"name\":\"MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1999.821337\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1999.821337","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

提出了一种新的网络概率连通性算法。在该算法中，给出了网络状态空间的多步分解算法。提出了一种对得到的事件构造子图的新方法，可以大大降低网络状态空间的维数。采用迭代计算方法逼近了概率连通性值的下界。与其他算法相比，我们的算法具有计算速度快、收敛速度快的特点，最适合于近似计算。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new algorithm for network probabilistic connectivity

A new algorithm for network probabilistic connectivity is presented. In this algorithm, the multi-step decomposition algorithm of the network states space is given. A new method to construct sub-graphs for the obtained events is proposed, which can greatly reduce the dimensions of network states space. An iterative computation is used to approximate lower bound of the value of the probabilistic connectivity. Compared with other algorithms, ours is characterized by its fast computing and converging speed, and is most suitable for approximating computation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341)

自引率

0.00%

发文量