1) Predication of shortest travel time path
最小路径预测
2) minimal path
最小路径
1.
A complex systemis usually described by minimal paths or minimal cutsets.
描述系统结构通常是用最小路径或最小割集。
2.
In this paper,we discuss the problem about description and calculation of reliability based on minimal path and minimal cutset for the class of complex system.
本文讨论基于最小路径和最小割集的复杂系统可靠性的描述与计算问题。
3) Predicting the BGP routes
路径预测
1.
Predicting the BGP routes is particularly difficult when the BGP selection process does not form a deterministic ranking of the routes,due to the route reflection.
由于路由反射器的影响,路由器可能只知道非常有限的到达外部目的地的路由的子集,BGP路径选择过程并不会形成一个确定的路径等级顺序,使得路径预测变得非常困难。
4) Second Shortest Travel Time Path
次最小路径
5) the minmax path
最大权最小路径
1.
Key wrods:the minimum spanning tree; the minmax path; the minmax adjustment time; risk out of stoc
通过分析任意点对之间字典序下最大权最小路径和最小生成树之间的关系,给出了解决上述问题的有效算法。
6) minimal prediction set
最小预测集
1.
For reducing the spaces of rule database and facilitating users to query,the minimal prediction set is used and mined using maximum frequent item sets which are found by a set-enumeration tree.
为缩减关联规则存储空间和方便查询关联规则,提出一种前件为单一项目的最小预测集算法。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条