说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 正交矩形Packing问题
1)  the orthogonal rectangular Packing problem
正交矩形Packing问题
2)  rectangles packing problem
矩形packing问题
1.
The protein structure prediction problem and the rectangles packing problem are NP-hard problems.
蛋白质结构预测问题和矩形packing问题都是NP难度问题。
3)  circle-rectangular mixed packing problem
圆形与矩形Packing问题
4)  circle packing problem
圆形packing问题
1.
To solve the circle packing problem that encounters in the field of transportation of freight, a heuristic algorithm is proposed for finding a good arrangement of multiple different-sized circles within a larger rectangular container.
求解具有NP难度的圆形packing问题具有很高的理论与实用价值。
5)  triangle packing problem
三角形Packing问题
1.
The problem called rectangle triangulation problem which is a special case of triangle packing problem is proposed and proved to be NP complete,a necessary condition that ensures the problem have a solution is given.
给出了矩形的三角形划分问题的定义,该问题是三角形Packing问题的一个特例,证明了该问题是NP完全的,并给出了该问题有解的一个必要条件。
6)  packing problem
packing问题
1.
The triangles packing problem is NP-hard.
三角形Packing问题是NP难的,其完整算法的时间复杂度是指数型的。
2.
Inspired by an old adage "gold corner, silver side and strawy void", the idea is improved with "diamond cave" and a new quasi-human algorithm is proposed for solving a typical NP-hard problem, the famous cuboids packing problem.
对典型的NP难度问题——著名的长方体Packing问题,通过观察体会人类几千年来在砌石头下围棋等活动中形成的经验和智慧,受到谚语"金角银边草肚皮"的启发,并将它发展提高到"价值最高钻石穴",提出了一种最大穴度的占角动作优先处理的拟人算法。
3.
The arranging and scheduling of lock chambers is described with a mathematical model of tow-dimension Packing problem,which is a typical NP totality problem.
提出一种基于分步降维思想的启发式快速编排算法,该算法把闸室编排二维Packing问题降到一维求解,有效解决三峡-葛洲坝联合调度的计划编排中与闸室编排相耦合的时间表问题。
补充资料:pellicular packing
分子式:
CAS号:

性质:又称表面多孔型填充剂(superficially porous packing)。一种现代液相色谱填料。在惰性核表面有一均匀多孔薄层。以直径30μm左右的球形玻璃实心核为基体,将纳米级粒度的硅胶(或氧化铝)细粉黏结在表面上,经高温烧结,形成很薄(1~2μm)的多孔薄层。经化学键合反应后也可制成化学键合填料。这种填料渗透性好、性质速率高。

说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条