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

图标索引 历史查询
 

half edge graph
相关语句
  半边图
     Half Edge Graph Partitioning Model for Machine Redundant Manufacturing Cell Design
     机器可选制造单元设计的半边图划分模型
短句来源
     Half Edge Graph and Extrude Intake Algorithm for Manufacturing Cell Design
     半边图与挤出吸入算法及制造单元设计
短句来源
     Half Edge Graph Extrude Intake Algorithm for Machine Redundant Manufacturing Cell Design
     机器可选制造单元设计的半边图挤出吸入算法
短句来源
     Half Edge Graph and Disassemble Assemble Algorithm for Manufacturing Cell Design
     制造单元设计中心半边图与拆分重组算法
短句来源
     Having Designed an extrude intake algorithm for the half edge graph partitioning problem,this algorithm can solve machine redundant manufacturing cell design problem.
     设计了针对半边图划分问题的半边图挤出吸入算法,用此算法求解了机器可选制造单元成组设计问题。
短句来源
更多       
  相似匹配句对
     Edge
     边缘
短句来源
     Generation Calculus of Half Edge Graph
     半边图模型之构造演算
短句来源
     Aggregation and Reduction Calculus of Half Edge Graph
     半边图模型之聚合归约演算
短句来源
     Hierarchical Recognition System of Half Edge Graph
     半边图模型之多层次认知系统
短句来源
     Half-edge Structure Based Modeling of Exploded Fragments
     基于半边结构的爆炸破片模型的随机分类构造法
短句来源
查询“half edge graph”译词为用户自定义的双语例句

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


Proposed half edge self assemble graph theory,half edge belong to vertex,a couple of half edges could assembled one edge.The probably solution of complex combination optimizm problem can describe by half edge graphs,designed a extrude intake algorithm for graph,this algorithm can solve manufacturing cell design problem.Half edge graph theory can represent complex structure and various constraint accurately.For a 20?50 example,only 4 times extrude...

Proposed half edge self assemble graph theory,half edge belong to vertex,a couple of half edges could assembled one edge.The probably solution of complex combination optimizm problem can describe by half edge graphs,designed a extrude intake algorithm for graph,this algorithm can solve manufacturing cell design problem.Half edge graph theory can represent complex structure and various constraint accurately.For a 20?50 example,only 4 times extrude and intake get the optimizm solution.

提出半边自组图理论,半边附属于顶点,一对半边可结合为边。用半边图来描述复杂组合优化问题的可能解,在此基础上设计了针对图的挤出吸入算法,用此算法求解了一个典型的复杂组合优化问题,制造单元设计问题。示例表明,半边图语言能够准确地表达可能解中的复杂结构和各种约束,20台机器50种零件分组实验证明,4次迭代计算即可达到优化目标。

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...

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 optimizm solution.

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

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

 


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

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