助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   graph partition problem 的翻译结果: 查询用时:0.009秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

graph partition problem     
相关语句
  图划分问题
     IMPROVED APPROXIMATION ALGORITHM FOR GRAPH PARTITION PROBLEM
     关于图划分问题的改进的近似算法
短句来源
  图的划分
     There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem.
     七号信令网拓扑优化中存在高级信令转接点 (HSTP)的 A/ B平面划分问题 ,其可归纳为一类新的图的划分问题 .
短句来源
     The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
     将表示电路的超图转化成带权值的无向图 ,从而将电路二等分问题转化成图的划分问题。
短句来源
     Since the graph partition problem has the well known SDP (semidefinite programming) relaxation, the strengthened SDP relaxation is achieved by an addition of two nonlinear constraints to SDP relaxation. Theory and numerical experiment ensure that the strengthened SDP relaxation gives the problem of circuit bisection a lower bound greater than exited lower bownds.
     图的划分问题存在已知的半定规划松弛 ,在此半定规划松弛基础上增加两个非线性结束 ,得到了强化半定规划松弛 ,定理和数值试验保证了强化半定规划松弛给出原问题一个更好的下界。
短句来源
  图的划分问题
     There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem.
     七号信令网拓扑优化中存在高级信令转接点 (HSTP)的 A/ B平面划分问题 ,其可归纳为一类新的图的划分问题 .
短句来源
     The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
     将表示电路的超图转化成带权值的无向图 ,从而将电路二等分问题转化成图的划分问题
短句来源
     Since the graph partition problem has the well known SDP (semidefinite programming) relaxation, the strengthened SDP relaxation is achieved by an addition of two nonlinear constraints to SDP relaxation. Theory and numerical experiment ensure that the strengthened SDP relaxation gives the problem of circuit bisection a lower bound greater than exited lower bownds.
     图的划分问题存在已知的半定规划松弛 ,在此半定规划松弛基础上增加两个非线性结束 ,得到了强化半定规划松弛 ,定理和数值试验保证了强化半定规划松弛给出原问题一个更好的下界。
短句来源
  关于图划分问题
     IMPROVED APPROXIMATION ALGORITHM FOR GRAPH PARTITION PROBLEM
     关于图划分问题的改进的近似算法
短句来源

 

查询“graph partition problem”译词为其他词的双语例句

     

    查询“graph partition problem”译词为用户自定义的双语例句

        我想查看译文中含有:的双语例句
    例句
    为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
      graph partition problem
    A linear integer-programming algorithm has been implemented to solve the graph partition problem rigorously and efficiently.
          
    We have formulated the problem as a graph partition problem.
          
    We show how this technique can be applied to the Quadratic Assignment Problem, the Graph Partition Problem and the Max-Clique Problem.
          
    This result on extended neighborhoods relies on a proof that the convex hull of solutions for the graph partition problem has a diameter of 1, that is, every two corner points of this polytope are adjacent.
          
    We also show that the extended neighborhood for the graph partition problem is the same as the original neighborhood, regardless of the neighborhood defined.
          
    更多          


    This paper shows a graph partition problem pblynomially solvable. Moreover, the problemin the planar case leads to a number of problems in graphs and combinatorial optimisationspolynomially solvable.

    AGRAPHPARTITIONPROBLEM¥LIUTANPEI(刘彦佩)(DeparfmentofMathematics,NorthernJiaotonyUniversity,Beijing100044,China)AURORAMORGANA(De...

    There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem. The problem is proved to be NP-complete, so the neural network, the genetic algorithm and the simulated annealing are applied to solve it. In order to make the algorithms comparable, the testing schemes are carefully designed. The computing results for the three algorithms show that the genetic algorithm and the simulated annealing are quite...

    There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem. The problem is proved to be NP-complete, so the neural network, the genetic algorithm and the simulated annealing are applied to solve it. In order to make the algorithms comparable, the testing schemes are carefully designed. The computing results for the three algorithms show that the genetic algorithm and the simulated annealing are quite robust for the problem, they can search out the optimum with a larger probability and a higher efficiency.

    七号信令网拓扑优化中存在高级信令转接点 (HSTP)的 A/ B平面划分问题 ,其可归纳为一类新的图的划分问题 .该问题被证明难度是 NP完备的 ,神经网络、遗传算法和模拟退火等启发式算法被应用于该问题的求解 .为了算法的可比性 ,精心设计了试验方案 ,计算结果显示遗传算法和模拟退火可以很高的概率和效率搜索到该问题的最优解

    The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem. Since the graph partition problem has the well known SDP (semidefinite programming) relaxation, the strengthened SDP relaxation is achieved by an addition of two nonlinear constraints to SDP relaxation. Theory and numerical experiment ensure that the strengthened SDP relaxation gives the problem of circuit bisection a lower bound...

    The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem. Since the graph partition problem has the well known SDP (semidefinite programming) relaxation, the strengthened SDP relaxation is achieved by an addition of two nonlinear constraints to SDP relaxation. Theory and numerical experiment ensure that the strengthened SDP relaxation gives the problem of circuit bisection a lower bound greater than exited lower bownds.

    将表示电路的超图转化成带权值的无向图 ,从而将电路二等分问题转化成图的划分问题。图的划分问题存在已知的半定规划松弛 ,在此半定规划松弛基础上增加两个非线性结束 ,得到了强化半定规划松弛 ,定理和数值试验保证了强化半定规划松弛给出原问题一个更好的下界。

     
    << 更多相关文摘    
    图标索引 相关查询

     


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

    CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
    版权图标  2008 CNKI-中国知网
    京ICP证040431号 互联网出版许可证 新出网证(京)字008号
    北京市公安局海淀分局 备案号:110 1081725
    版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社