1) non-dominated solution sets
非支配解集
2) non-dominated set
非支配集
1.
This paper improves the approach of constructing non-dominated set in NSGA-Ⅱ.
在NSGA-Ⅱ算法的基础上,对NSGA-Ⅱ构造非支配集的方法进行了改进,用擂台赛法则构造非支配集,当非支配集小于种群大小时,采用随机算子在可行域内随机产生新的解个体填充到下一代父种群中,形成了一种新的多目标遗传算法。
2.
Most MOEAs employ clustering to keep the diversity and variety of solutions and construct the non-dominated set to make algorithms efficient.
在进化算法中一般采用构造非支配集的方法来保持算法的运行效率和解集的分布性;采用聚类技术来计算和维持解群体的分布性和多样性。
3.
It is a very important step to construct non-dominated set of evolutionary population for the Multi-Objective Genetic Algorithm(MOGA).
多目标遗传算法的一个重要步骤就是构造非支配集,本文提出了一种基于快速排序的非支配集构造方法,提高了非支配集构造效率,并且在Deb提出的NSGAⅡ的基础上,改进了其种群构造策略,设计了一类新的多目标遗传算法。
3) nondominated solution
非支配解
4) Non-dominated solution
非支配解
1.
In this paper some proposed metrics measuring the quality of non-dominated solutions are classified and analyzed in order to provide references for assessment and comparison of performance of the algorithms.
多目标演化算法的目的是获得逼近Pareto最优前沿的分布均匀的非支配解集合,非支配解集的质量是多目标演化算法研究的重要领域。
5) Pareto non-dominated set
Pareto非支配集
1.
Fast method of constructing multi-objective Pareto non-dominated set:election principle
一种快速构造多目标Pareto非支配集的方法:选举法则
6) dominating set
支配集
1.
Through researching into the independent and dominating set in graph theory, this paper has put forward a concept of independent-dominating set and has expounded and proved the internal relationship among the following three concepts: independent-dominating set , maximal independent set and minimal dominating set.
通过对图论中独立集和支配集的深入研究，提出了独立支配集的概念，论证了独立支配集同极大独立集及极小支配集之间的内在联系，并在此基础上给出了独立支配集的最佳求解算法，从而圆满地解决了图论中独立集及支配集的求解问题，对图的着色及匹配等问题的研究均有相当重要的借鉴意义。
2.
Based on the theoretical analysis of the sensing coverage property of the minimal dominating set, the relationship between point coverage and area coverage in geometric graph is established.
根据分析结果,基于构建连通支配集CDS(connected dominating set)的RuleK算法,提出了一种与节点位置无关网络连通性覆盖协议LICCP(location-independent connected coverage protocol)。
3.
In wireless ad-hoc networks,routing based on connected dominating set is a promised approach,where the searching space for route is reduced to nodes in the dominating set.
在ad-hoc网络中,基于最小连通支配集(minimumconnecteddominatingset---MCDS)的路由方法是一种有效的分层路由方法,它将路由搜索主要集中在连通支配集内。
补充资料：非想非非想处天
1.佛教语。即三界中无色界第四天。此天没有欲望与物质﹐仅有微妙的思想。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条