首页> 外文会议>International workshop on heuristics >Complexity and Dependence Degree of Optimization of the N-K Problem
【24h】

Complexity and Dependence Degree of Optimization of the N-K Problem

机译:N-K问题优化的复杂性和依赖程度

获取原文

摘要

The optimization of N-K fitness function has recently received much of attention in Genetic Algorithm (GA) community. In this paper, we introduce the concept of dependence degree for N-K fitness functions, and give some results on the computational complexity of N-K problems in terms of their dependence degree.
机译:N-K健身功能的优化最近在遗传算法(GA)社区中的大部分注意力。在本文中,我们介绍了N-K健身功能的依赖程度的概念,并在其依赖程度方面给出了N-K问题的计算复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号