1) minimum cost coefficient route
最小代价系数路
1.
the minimum cost coefficient route will be got.
利用线性规则、图论等方面的知识，求取最小代价系数路，进而得出最佳的航空弹药调拨方案。
2) minimum cost routing tree
最小代价路径树
3) least cost function
最小代价函数
4) minimum cost
最小代价
1.
The selection scenario is used to construct tree-shape communication routing,and it can achieve alternative packets transmission between every node in spanning tree and minimum cost/directed par.
在适合数据融合的生成树算法的基础上,分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。
2.
Consider the too much redundant data and the non-balanced energy consumption of the routing protocol based on the minimum cost,proposed a new algorithm——MHEP routing algorithm.
针对基于最小代价的路由算法冗余信息过多和能耗不均衡问题,提出了一种新的路由算法——MHEP算法。
3.
Using FMPH that has high computing effciency,we can find a minimum cost tree as same as the tree coming from MPH.
本文针对MPH(MinimumPathCostHeuristic)等多播最小生成树算法存在的问题 ,通过改进最短路径节点的搜寻过程 ,以较小的存储空间为代价 ,获得了计算效率很高的快速最小代价多播生成树算法FMPH(FastMinimumPathCostHeuristic) ,且获得多播生成树与MPH算法完全相同 。
5) minimal cost
最小代价
1.
An improved algorithm for minimal cost network coding;
一种改进的最小代价网络编码算法
2.
The corresponding priced timed automatons based on these paths are then constructed,and minimal costs obtained.
着重解决代价和概率时间自动机模型的可达性问题,即满足一定概率要求的最小代价问题。
6) minimum routing cost spanning tree
最小路由代价生成树
1.
Then a method of images mosaicing based on minimum routing cost spanning tree is proposed to calculate global optimum position of every image by constructing the minimum routing cost spanning tree of the mosaicing graph and to create the panoramic image.
为了对大规模显微图像进行高质量的拼接,首先提出拼接图的概念及获得高质量全景图像的3个原则,然后采用分块-空间聚类算法配准相邻图像,同时评估配准质量,并计算拼接图的边的权值;最后在此基础上,提出了一种基于最小路由代价生成树的图像拼接方法,该方法通过计算拼接图的最小路由代价生成树来确定所有图像的全局位置,并用来生成全景图像。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条