1) Modified Least-Cost Scheduling(MLCS)
相近最小代价调度
1.
A Modified Least-Cost Scheduling(MLCS) strategy was discussed,which was fit for Internet Networked Control System(NCS).
将覆盖网络引入到基于Internet的网络控制系统(NCS)中,讨论了一种适合于Internet网络控制系统的相近最小代价调度(MLCS)策略,并对其进行了优化。
2) 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算法完全相同 。
3) 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.
着重解决代价和概率时间自动机模型的可达性问题,即满足一定概率要求的最小代价问题。
4) minimum cost tree
最小代价树
5) The-least Distance Sim-ilarity
最近相似度
6) minimum-phase approximation
最小相位近似
1.
The first is that the minimum-phase approximation of the near-filed HRTF fits well for most directions except for contralateral and frontal directions.
通过分析近场HRTF原函数与最小相位近似函数之间的相关性和相位误差,研究生理结构影响近场HRTF最小相位特性的空间规律。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条