一种寻找互斥假设图次优分支的概率搜索算法

Int. J. Knowl. Based Intell. Eng. Syst. Pub Date : 2014-10-01 DOI:10.3233/KES-140302

M. V. Davydov

{"title":"一种寻找互斥假设图次优分支的概率搜索算法","authors":"M. V. Davydov","doi":"10.3233/KES-140302","DOIUrl":null,"url":null,"abstract":"The concept of mutually exclusive hypothesis graph (MEHG) is introduced and NP-completeness of several problems on MEHG is proved. A probabilistic search algorithm is proposed for finding suboptimal branchings in such graphs and its performance is evaluated for graphs with uniform and exponential weight distribution.","PeriodicalId":210048,"journal":{"name":"Int. J. Knowl. Based Intell. Eng. Syst.","volume":"211 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A probabilistic search algorithm for finding suboptimal branchings in mutually exclusive hypothesis graph\",\"authors\":\"M. V. Davydov\",\"doi\":\"10.3233/KES-140302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The concept of mutually exclusive hypothesis graph (MEHG) is introduced and NP-completeness of several problems on MEHG is proved. A probabilistic search algorithm is proposed for finding suboptimal branchings in such graphs and its performance is evaluated for graphs with uniform and exponential weight distribution.\",\"PeriodicalId\":210048,\"journal\":{\"name\":\"Int. J. Knowl. Based Intell. Eng. Syst.\",\"volume\":\"211 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Knowl. Based Intell. Eng. Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/KES-140302\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Knowl. Based Intell. Eng. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/KES-140302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

引入了互斥假设图的概念，证明了互斥假设图上若干问题的np -完备性。提出了一种查找次优分支的概率搜索算法，并对权值均匀分布和指数分布的图进行了性能评价。

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

查看原文本刊更多论文

A probabilistic search algorithm for finding suboptimal branchings in mutually exclusive hypothesis graph

The concept of mutually exclusive hypothesis graph (MEHG) is introduced and NP-completeness of several problems on MEHG is proved. A probabilistic search algorithm is proposed for finding suboptimal branchings in such graphs and its performance is evaluated for graphs with uniform and exponential weight distribution.

求助全文

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

来源期刊

Int. J. Knowl. Based Intell. Eng. Syst.

自引率

0.00%

发文量