MCILS: Monte-Carlo Interpolation Least-Square Algorithm for Approximation of Edge-Reliability Polynomial

A. H. Hadian-Rasanan, D. Rahmati, S. Gorgin, J. Rad
{"title":"MCILS: Monte-Carlo Interpolation Least-Square Algorithm for Approximation of Edge-Reliability Polynomial","authors":"A. H. Hadian-Rasanan, D. Rahmati, S. Gorgin, J. Rad","doi":"10.1109/ICCKE48569.2019.8965173","DOIUrl":null,"url":null,"abstract":"Edge reliability problem has many applications in different field of science and engineering such as: cognitive science, neuroscience, electrical engineering, network science and so on. The major challenge in this problem is time complexity of the exact algorithm. Computing the reliability of a network is NP-hard problem. So, computing the reliability of a large scale network is a challenging problem. In this paper, we present a novel algorithm based on a hybrid Monte-Carlo, interpolation and least-square methods to approximate the reliability of a network. The presented algorithm is applied on some networks that the exact reliability polynomial is available for them. the experiments show that the presented algorithm is accurate and robust.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"27 1","pages":"295-299"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE48569.2019.8965173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Edge reliability problem has many applications in different field of science and engineering such as: cognitive science, neuroscience, electrical engineering, network science and so on. The major challenge in this problem is time complexity of the exact algorithm. Computing the reliability of a network is NP-hard problem. So, computing the reliability of a large scale network is a challenging problem. In this paper, we present a novel algorithm based on a hybrid Monte-Carlo, interpolation and least-square methods to approximate the reliability of a network. The presented algorithm is applied on some networks that the exact reliability polynomial is available for them. the experiments show that the presented algorithm is accurate and robust.
边缘可靠性多项式逼近的蒙特卡罗插值最小二乘算法
边缘可靠性问题在认知科学、神经科学、电子工程、网络科学等不同的科学和工程领域有着广泛的应用。该问题的主要挑战是精确算法的时间复杂度。计算网络的可靠性是NP-hard问题。因此,计算大规模网络的可靠性是一个具有挑战性的问题。本文提出了一种基于蒙特卡罗、插值和最小二乘混合方法的网络可靠性近似算法。将该算法应用于具有精确可靠性多项式的网络。实验结果表明,该算法具有较好的鲁棒性和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信