1) smallest repeating match
最小重复匹配
2) largst repeating match
最大重复匹配
3) repeated matching
重复匹配
1.
Based on the idea of repeated matching and clustering arithmetic, the heuristic rules and heuristic algorithm for packing and scheduling problem are put forward.
利用重复匹配算法、聚合算法等启发式方法 ,提出了布局调度操作的启发式规则及相应的启发式算法 。
4) minimum weight match problem
最小权重匹配问题
5) least weight match algorithm
最小权匹配
1.
Three steps of the method are:first,genetic algorithm is adopted in the whole planning area to hunt the possible traverse sequence of the substations;second,the least weight match algorithm in graph theory is adopted to optimize the tie lines between each substation and its neighbo.
第一层优化是在整个规划区域内,应用遗传算法搜索可能的变电站的遍历顺序;第二层优化是按照第一层优化确定的遍历顺序,应用网络图论中的最小权匹配算法分别对每一个变电站与其相邻站之间的联络线进行优化。
6) Minimum matching matroid
最小匹配数
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条