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

图标索引 历史查询
 

矩形packing
相关语句
  rectangle packing
     Anthropopathic Approximate Arithmetic of Rectangle Packing Problem in Open Orthogonal Receptacle
     敞口直角容器矩形packing问题的拟人近似算法
短句来源
     As is all known,rectangle packing problem indicates generally that making pieces of rectangle pack to the close rectangle receptacle which has NP hard.
     众所周知,矩形Packing问题一般指将众多矩形置入一封闭矩形容器,具有NP难度。
短句来源
  rectangles packing
     A Deterministic Heuristic Algorithm Based on Euclidian Distance for Solving the Rectangles Packing Problem
     基于欧氏距离的矩形Packing问题的确定性启发式求解算法
短句来源
  “矩形packing”译为未确定词的双语例句
     Greedy Algorithm for Rectangle-packing Problem
     求解矩形packing问题的贪心算法
短句来源
     The rectangle-packing problem often appears in loading,timber cutting,very large scale integration design,etc.
     在货物装载、木材下料、超大规模集成电路设计等工作中提出了矩形packing问题。
短句来源
     This paper recommends an efficient greedy algorithm according to ten-thousand-year experience and wisdom of human being.
     该文利用人类的智慧及历史上形成的经验,提出了一种求解矩形packing问题的贪心算法。
短句来源
     Experimental results demonstrate that the algorithm developed is fairly efficient for solving rectangle-packing problem.
     测试结果表明,该算法对求解矩形packing问题相当有效。
短句来源
  相似匹配句对
     Greedy Algorithm for Rectangle-packing Problem
     求解矩形packing问题的贪心算法
短句来源
     Anthropopathic Approximate Arithmetic of Rectangle Packing Problem in Open Orthogonal Receptacle
     敞口直角容器矩形packing问题的拟人近似算法
短句来源
     On the Analysis of Rectangular Plate Lattice Structure
     矩形板格分析
短句来源
     On the Rolling Process of Rectangular Tubular Products
     矩形管材的轧制
短句来源
     PACKING DIMENSION ON PROBABILITY SPACE
     概率空间上的Packing维数
短句来源
查询“矩形packing”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  rectangle packing
Consideration was given to different formulations of the rectangle packing problem for which methods of information coding exist.
      
We model this as a rectangle packing problem on a cylinder and use a sequence pair based simulated annealing algorithm to solve the problem.
      
Expected wasted space of optimal simple rectangle packing
      
Local search algorithms for the rectangle packing problem with general spatial costs
      
We propose local search algorithms for the rectangle packing problem to minimize a general spatial cost associated with the locations of rectangles.
      
更多          


Solving NP hard problem is the bottleneck task for computer science and technology nowadays. In recent years, investigations show that for NP hard problems, there may not exist an algorithm that is both complete and rigorous and not too slow. So its solution methods are usually heuristic. The rectangles Packing problem is NP hard. Given a set of rectangles with fixed width and height and a larger rectangle, the rectangles Packing problem is to find a good layout by Packing these rectangles without overlapping...

Solving NP hard problem is the bottleneck task for computer science and technology nowadays. In recent years, investigations show that for NP hard problems, there may not exist an algorithm that is both complete and rigorous and not too slow. So its solution methods are usually heuristic. The rectangles Packing problem is NP hard. Given a set of rectangles with fixed width and height and a larger rectangle, the rectangles Packing problem is to find a good layout by Packing these rectangles without overlapping entirely inside a larger rectangle. In this paper, based on the quasi-human strategy, the authors propose the so-called corner-occupying and largest hole degree first placement policy based on Euclidian distance. An effective heuristic algorithm is presented, and the solution to the rectangles Packing problem can be obtained quickly by applying this algorithm. Experimental results on MCNC and GSRC benchmark circuits demonstrate that the algorithm is quite effective in solving the problem.

使用拟人的策略,提出了基于欧氏距离的占角最大穴度优先的放置方法,为矩形Packing问题的快速求解提供了一种高效的启发式算法.算法的高效性通过应用于标准电路MCNC和GSRC得到了验证.

The rectangle-packing problem often appears in loading,timber cutting,very large scale integration design,etc.Many algorithms such as simulated annealing,genetic algorithm and other heuristic algorithms are proposed to solve it.This paper recommends an efficient greedy algorithm according to ten-thousand-year experience and wisdom of human being.Twenty-one public instances are tested by the algorithm developed.The average trim loss and runtime is 0.28% and 17.86s respectively.Furthermore,8 instances are achieved...

The rectangle-packing problem often appears in loading,timber cutting,very large scale integration design,etc.Many algorithms such as simulated annealing,genetic algorithm and other heuristic algorithms are proposed to solve it.This paper recommends an efficient greedy algorithm according to ten-thousand-year experience and wisdom of human being.Twenty-one public instances are tested by the algorithm developed.The average trim loss and runtime is 0.28% and 17.86s respectively.Furthermore,8 instances are achieved optimum solutions.Experimental results demonstrate that the algorithm developed is fairly efficient for solving rectangle-packing problem.

在货物装载、木材下料、超大规模集成电路设计等工作中提出了矩形packing问题。对这一问题,国内外学者提出了诸如模拟退火算法、遗传算法及其它一些启发式算法等求解算法。该文利用人类的智慧及历史上形成的经验,提出了一种求解矩形packing问题的贪心算法。并对21个公开测试实例进行了实算测试,所得结果的平均面积未利用率为0.28%,平均计算时间为17.86s,并且还得到了其中8个实例的最优解。测试结果表明,该算法对求解矩形packing问题相当有效。

 
图标索引 相关查询

 


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

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