1) minimal main text subtree
最小正文子树
2) minimal subtree graph
最小子树图
1.
An algorithm for search of minimal subtree graphs based on multicast routing graphs
一种基于多播路由图的最小子树图搜索算法
3) minimal not balanced subtree
最小不平衡子树
4) MSPCF
最小和修正因子
1.
Through analysis and comparison with the decoding performance and complexity of the five kinds of decoding algorithm, we could conclude that MS (Min-Sum decoding algorithm) and MSPCF (Min-Sum-Plus-correcting-factor algorithm) hold the lower complexity; and moreover, MSPCF possessed better decoding performance than MS while under the same complexity.
通过对五种算法译码性能和复杂度分析比较,得出MS(最小和译码算法)和MSPCF(最小和修正因子算法)复杂度较低;而且在同样复杂度的情况下,MSPCF算法比MS算法具有更好的译码性能,因此本文设计的译码器采用MSPCF算法。
5) Minimum steiner tree
最小Steiner树
1.
The minimum Steiner tree problem is one of the NP-hard problems, which has extensive applications in many real-world problem,such as communications network.
最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用。
2.
In this algorithm,used directed diffusion(DD)to deliver interest,and used MMAS algorithm to construct a minimum Steiner tree.
该算法采用定向扩散的机制进行兴趣散布;利用MMAS算法构造一个最小Steiner树,源节点的数据发送到构造好的最小Steiner树上,经过融合后传输到sink节点,降低了网络中传输的数据量。
3.
This paper analyses the theoretical basis and realization methods of relational database systems and keyword search technology, proposes content-based similarity calculate method and Minimum Steiner tree based AST query algorithm.
本文对关系数据库系统和关键词查询技术的理论基础和实现方法进行了分析,提出了基于内容的相似度计算方法和基于最小Steiner树求解的AST查询算法。
6) minimum spanning tree
最小树
1.
A new real-time reconfiguration approach for large-scale distribution system, based on the minimum spanning tree algorithm and the switch exchange method, is presented.
提出了一种利用最小树算法和开关交换方法进行大规模配电网重构的新方法。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条