首页> Evolutionary computation> A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting.

A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting.

导出 LinkOut

翻译打印收藏纠错

第一作者： Patrik,Gustavsson

第一单位： School of Engineering, University of Skövde, Skövde, 54134, Sweden patrik.gustavsson@his.se.

作者： Patrik,Gustavsson ^[1] ; Anna,Syberfeldt ^[2]

作者单位： School of Engineering, University of Skövde, Skövde, 54134, Sweden patrik.gustavsson@his.se. ^[1] School of Engineering, University of Skövde, Skövde, 54134, Sweden anna.syberfeldt@his.se. ^[2]

关键词 Evolutionary computation Pareto optimality k-d tree multi-objective evolutionary algorithms non-dominated sorting runtime complexity.

医学主题词算法(Algorithms);生物进化(Biological Evolution);数据说明, 统计(Data Interpretation, Statistical);决策树(Decision Trees);模型, 生物学(Models, Biological)

DOI 10.1162/EVCO_a_00204

PMID 28103060

发布时间 2018-09-17

翻译满意度评价：

准确一般字义偏差语意偏离译文作用小提交

浏览17

Evolutionary computation

89-116页

相似文献

中文期刊
外文期刊
学位论文
会议论文

浏览17

点击下载本期目录封面

Evolutionary computation

89-116页

检索历史清除

A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting.

Evolutionary computation

相似文献

同项目论文

Evolutionary computation

相关期刊

参考文献：
指定格式：	NoteExpress EndNote RefWorks NoteFirst

检索历史 清除

A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting.

Evolutionary computation

相似文献

同项目论文

Evolutionary computation

相关期刊

检索历史清除