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

M.V. Davydov

首页> 外文期刊>International journal of knowledge-based and intelligent engineering systems >A probabilistic search algorithm for finding suboptimal branchings in mutually exclusive hypothesis graph

【24h】

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.

机译：介绍了互斥假设图（MEHG）的概念，并证明了MEHG上几个问题的NP完全性。提出了一种概率搜索算法，用于在此类图中找到次优分支，并对具有均匀和指数权重分布的图的性能进行了评估。

著录项

来源
《International journal of knowledge-based and intelligent engineering systems》 |2014年第4期|247-253|共7页
作者
M.V. Davydov;
展开▼
作者单位

L'viv Polytechnic National University, 12 Bandery Street, L'viv, Ukraine;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
Mutually exclusive hypothesis graph; Edmonds' algorithm; suboptimal branching;

机译：互斥假设图;埃德蒙兹算法;次优分支;

相似文献

外文文献
中文文献
专利

1. An Impatient Evolutionary Algorithm With Probabilistic Tabu Search for Unified Solution of Some NP-Hard Problems in Graph and Set Theory via Clique Finding [J] . Guturu P., Dantu R. IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics . 2008,第3期

机译：带有概率禁忌的不耐烦进化算法，用于基于图集查找的图集理论中的一些NP-Hard问题统一解
2. An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem [J] . Songjian Lu, Gunasheil Mandava, Gaibo Yan, Algorithms for Molecular Biology . 2016,第1期

机译：查找癌症驾驶员体细胞基因组改变的精确算法：加权互斥最大集覆盖问题
3. Comparative Analysis of the Findings of Postmortem Computed Tomography Scan and Traditional Autopsy in Traumatic Deaths: Is Technology Mutually Complementing or Exclusive? [J] . Biplab Mishra, Mohit Kumar Joshi, Sanjeev Lalwani, Archives of Trauma Research . 2018,第1期

机译：死后计算机断层扫描和传统尸检的结果比较分析：技术是相辅相成的还是排他的？
4. NC algorithms for finding depth-first-search trees in interval graphs and circular-arc graphs [C] . Liang, Y., Rhee, . 1991

机译：在间隔图和圆弧图中查找深度优先搜索树的NC算法
5. Finding minimal cost paths in Raster geographic information system map representations, genetic algorithms, simulated annealing and tabu search. [D] . Albert, Paul. 2004

机译：在栅格地理信息系统地图表示，遗传算法，模拟退火和禁忌搜索中寻找最小成本路径。
6. An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem [O] . Songjian Lu, Gunasheil Mandava, Gaibo Yan, 2016

机译：查找癌症驾驶员体细胞基因组改变的精确算法：加权互斥最大集覆盖问题
7. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding [O] . Parthasarathy Guturu, Senior Member, Ram Dantu 2008

机译：一种不耐烦的进化算法，通过概率禁忌搜索图集和集合理论中的一些Np难问题的统一解
8. A Suboptimal Estimation Algorithm with Probabilistic Editing for False Measurements with Applications to Target Tracking with Wake Phenomena, [R] . athans,michael whiting, r. h. 1976

机译：一种利用概率编辑进行虚假测量的次优估计算法及其在尾迹跟踪中的应用

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

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅