蒙特卡罗可靠性组合学

Random Struct. Algorithms Pub Date : 1999-07-01 DOI:10.1002/(SICI)1098-2418(199907)14:4%3C329::AID-RSA3%3E3.0.CO;2-X

M. Lomonosov, Y. Shpungin

{"title":"蒙特卡罗可靠性组合学","authors":"M. Lomonosov, Y. Shpungin","doi":"10.1002/(SICI)1098-2418(199907)14:4%3C329::AID-RSA3%3E3.0.CO;2-X","DOIUrl":null,"url":null,"abstract":"We study one class of unbiased Monte Carlo estimators for system reliability, avoiding the rare event difficulty. This class is closely related to the system combinatorics and contains unique “extreme” members, having the minimum and maximum relative error. Some known Monte Carlo heuristics for network reliability, including fully polynomial cases, are of this type. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14: 329–343, 1999","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Combinatorics of reliability Monte Carlo\",\"authors\":\"M. Lomonosov, Y. Shpungin\",\"doi\":\"10.1002/(SICI)1098-2418(199907)14:4%3C329::AID-RSA3%3E3.0.CO;2-X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study one class of unbiased Monte Carlo estimators for system reliability, avoiding the rare event difficulty. This class is closely related to the system combinatorics and contains unique “extreme” members, having the minimum and maximum relative error. Some known Monte Carlo heuristics for network reliability, including fully polynomial cases, are of this type. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14: 329–343, 1999\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"139 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199907)14:4%3C329::AID-RSA3%3E3.0.CO;2-X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199907)14:4%3C329::AID-RSA3%3E3.0.CO;2-X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 17

摘要

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Combinatorics of reliability Monte Carlo

We study one class of unbiased Monte Carlo estimators for system reliability, avoiding the rare event difficulty. This class is closely related to the system combinatorics and contains unique “extreme” members, having the minimum and maximum relative error. Some known Monte Carlo heuristics for network reliability, including fully polynomial cases, are of this type. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14: 329–343, 1999

求助全文

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

来源期刊

Random Struct. Algorithms

自引率

0.00%

发文量

期刊最新文献

Monochromatic paths in random tournaments On Generalized Independent Subsets of Trees Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices On the effect of selection in genetic algorithms The Boyer-Moore-Horspool heuristic with Markovian input