助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   half edge graph partitioning problem 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时:0.595秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

half edge graph partitioning problem
相关语句
  半边图划分
    Half edge and its assembly can represent various constraints,Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph,multi-way half edge graph partitioning problem with redundant plan paths.
    用半边及其结合性表示各种局部约束,将机器可选制造单元设计问题转化为基于半边图的组合优化问题,即计划路径可选的半边图划分问题。
短句来源
    Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.
    计划路径可选的半边图划分问题是一类含有多种局部约束的复杂组合优化问题。
短句来源
    Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.
    设计了针对半边图划分问题的半边图挤出吸入算法,用此算法求解了机器可选制造单元成组设计问题。
短句来源
  半边图划分
    Half edge and its assembly can represent various constraints,Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph,multi-way half edge graph partitioning problem with redundant plan paths.
    用半边及其结合性表示各种局部约束,将机器可选制造单元设计问题转化为基于半边图的组合优化问题,即计划路径可选的半边图划分问题。
短句来源
    Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.
    计划路径可选的半边图划分问题是一类含有多种局部约束的复杂组合优化问题。
短句来源
    Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.
    设计了针对半边图划分问题的半边图挤出吸入算法,用此算法求解了机器可选制造单元成组设计问题。
短句来源
查询“half edge graph partitioning problem”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


Machine redundant manufacturing cell design is the complex combination optimal problem that has various constraints,Graph partition algorithm can't solve this problem,because the number of graphs that need to be partitioned is exponential.Proposed half edge graph theory,half edge belongs to vertex,a couple of half edges could assemble one edge.Half edge and its assembly can represent various constraints,Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph,multi-way...

Machine redundant manufacturing cell design is the complex combination optimal problem that has various constraints,Graph partition algorithm can't solve this problem,because the number of graphs that need to be partitioned is exponential.Proposed half edge graph theory,half edge belongs to vertex,a couple of half edges could assemble one edge.Half edge and its assembly can represent various constraints,Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge graph,multi-way half edge graph partitioning problem with redundant plan paths.

机器可选制造单元设计问题是一类含有多种局部约束的复杂组合优化问题,用图划分算法解决此类问题将会面临指数级个图的划分。论文提出半边图理论,半边附属于顶点,一对半边可结合为边。用半边及其结合性表示各种局部约束,将机器可选制造单元设计问题转化为基于半边图的组合优化问题,即计划路径可选的半边图划分问题。

Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.Half edge graph theory can represent complex structure and various constraint accurately.For a 20×20 example,on 12.4 average times extrude and intake can get the...

Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.Half edge graph theory can represent complex structure and various constraint accurately.For a 20×20 example,on 12.4 average times extrude and intake can get the optimizm solution.

计划路径可选的半边图划分问题是一类含有多种局部约束的复杂组合优化问题。设计了针对半边图划分问题的半边图挤出吸入算法,用此算法求解了机器可选制造单元成组设计问题。示例表明,半边图语言能够准确地表达可能解中的复杂结构和各种约束。20台机器20种零件分组实验证明,平均12.4次迭代计算即可达到优化目标。

 
图标索引 相关查询

 


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

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