全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 graph k-partitioning 的翻译结果: 查询用时：0.17秒
 在分类学科中查询 所有学科 数学 更多类别查询

 历史查询

 graph k-partitioning 图k-划分(3)图k划分(1)图k-划分问题(2)
 图k-划分
 Graph K-Partitioning Algorithm based on DBOA 基于决策图贝叶斯优化进化算法的图K-划分算法 短句来源 A Graph K-Partitiomng algorithm based on DBOA(Bayesian Optimization Algorithm with Decision Graphs) is put forward for this problem, which utilizes new coding and decoding method and appropriate fitness function solving Graph K-Partitioning problem. 针对该问题本文提出了一种基于决策图贝叶斯优化算法(Bayesian Optimization Algorithm with Decision Graphs,简称DBOA)的图K-划分, 该算法利用新的编码和解码方法以及适当的适应度函数来求解图K-划分问题。 短句来源 Graph K-Partitioning is key technology in stream of information Partitioning in Compiling Optimization, it is NP hard problem. 图K-划分问题是一种组合优化问题,可以归结为NP难题。 短句来源
 图k划分
 A Stochastic Algorithm for Graph K-Partitioning 一种图K划分的随机算法 短句来源
 图k-划分问题
 A Graph K-Partitiomng algorithm based on DBOA(Bayesian Optimization Algorithm with Decision Graphs) is put forward for this problem, which utilizes new coding and decoding method and appropriate fitness function solving Graph K-Partitioning problem. 针对该问题本文提出了一种基于决策图贝叶斯优化算法(Bayesian Optimization Algorithm with Decision Graphs,简称DBOA)的图K-划分, 该算法利用新的编码和解码方法以及适当的适应度函数来求解图K-划分问题。 短句来源 Graph K-Partitioning is key technology in stream of information Partitioning in Compiling Optimization, it is NP hard problem. 图K-划分问题是一种组合优化问题,可以归结为NP难题。 短句来源

我想查看译文中含有：的双语例句
 没有找到相关例句
 In this paper, a si mulated cvo lutionary annealing model for graph K partitioning is presented. Combining the simulated annealing and method of the simulated evolution, the proposed model im p lements a parallel strategy for multiobjective optimization, Both the theoretica l analysis and running results show that simulated evolution annealing has bette r performance and optimization result than simulated annealing. 本文提出一个求解图Ｋ划分难题的模拟进化退火模型。该模型将模拟退火和模拟进化方法相结合，实现了多目标并行寻优策略。理论分析和实验结果表明，模拟进化退火模型的性能更优，解的优化程度更高。 Graph K-Partitioning is key technology in stream of information Partitioning in Compiling Optimization, it is NP hard problem. A Graph K-Partitiomng algorithm based on DBOA(Bayesian Optimization Algorithm with Decision Graphs) is put forward for this problem, which utilizes new coding and decoding method and appropriate fitness function solving Graph K-Partitioning problem. The simulation results suggest that the scheme is feasible and effective. 图K-划分问题是一种组合优化问题,可以归结为NP难题。针对该问题本文提出了一种基于决策图贝叶斯优化算法(Bayesian Optimization Algorithm with Decision Graphs,简称DBOA)的图K-划分, 该算法利用新的编码和解码方法以及适当的适应度函数来求解图K-划分问题。仿真结果表明了该算法的可行性和有效性。
 相关查询

 CNKI小工具 在英文学术搜索中查有关graph k-partitioning的内容 在知识搜索中查有关graph k-partitioning的内容 在数字搜索中查有关graph k-partitioning的内容 在概念知识元中查有关graph k-partitioning的内容 在学术趋势中查有关graph k-partitioning的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社