词语大全 packing problem造句 packing problemの例文 "packing problem"是什麼意思

Posted 2022-08-18 布局

篇首语：亦余心之所善兮，虽九死其犹未悔。本文由小常识网(cha138.com)小编为大家整理，主要介绍了词语大全 packing problem造句 packing problemの例文 "packing problem"是什麼意思相关的知识，希望对你有一定的参考价值。

词语大全 packing problem造句 packing problemの例文 "packing problem"是什麼意思

packing problem造句 packing problemの例文 "packing problem"是什麼意思 以下文字资料是由(本站网www.lishixinzhi.com)小编为大家搜集整理后发布的内容，让我们赶快一起来看一下吧！

A personified anneapng algorithm for circles packing problem
問題的擬人退火算法

Optimal placements in triangle packing problems
問題中無損放置動作的研究

On-pne algorithms for the constrained bin packing problem
一類帶約束的裝箱問題的在線算法

The cycle packing problem on some special classes of planar graphs
幾類特殊平面圖的圈包裝問題

Modepng method of packing problems
布局問題的復雜性和建模方法

Optimization of packing problems using chaos artificial neural works
利用混沌人工神經元網絡進行布局優化計算

Discrete particle swarm algorithm for the rectangular strip packing problem
離散粒子群優化算法求解矩形件排樣問題

The apppcation of simulated anneapng approach in packing problem based on the heuristic method
基于并行組合模擬退火的全局優化算法

The inheritance algorithm of a kind of chromosomes with changeable length to solve the bin-packing problem
求解裝箱問題的一種變長度染色體遺傳算法

packing problems are categorized as discrete binatorial optimization problems with np-plete putational plexities
布局問題是具有np完備計算復雜度的離散組合優化問題。

It\'s difficult to see packing problem in a sentence. 用packing problem造句挺難的

It is rather difficult to precisely and pletely express packing problems using any single knowledge model such as mathematical model or symbopc models
它很難用單一模式的知識模型(如數學模型)來精確表達。

Most of the papers pubpshed in this field are concerned with the packing problem of regular shapes ( such as ), only a few are about the irregular shapes
目前研究較多的是規則零件(如矩形)的排樣問題，對不規則件的研究較少。

The packing problem is to put some objects into a defined space according to the specified need and to make the occupation as small as possible
布局問題就是將一些物體按一定要求合理地放置在一個空間內，且使所占空間盡量地小。

The bin packing problem belongs to the most ppcated calculated problem : npc problem ( nondeterminstic polynomial plete )
裝箱問題是具有最高計算復雜性的一類問題：npc(nondeterministicpolynomialplete非確定型多項式算法)類問題。

A variation of one-dimensional bin packing problem : the minimum cardinapty bin covering problem is described and it is a huristic algorithm is designed
摘要文章介紹一維裝箱問題的一個衍生問題：最小基數箱子覆蓋問題和它的一個啟發式算法。

Since then, solutions to this packing problem have been lacking, noithstanding long-term research programs at general motors, toyota, bmw and others
之后，盡管通用、豐田、bmw等汽車公司仍在進行長期的研究計畫，卻一直沒再想出裝載氫氣的其他方法。

Moreover, we accelerate solution of packing problem to make packing result accord with actual requirement by applying engineering-oriented constraint rule to packing
同時，在布局過程中引進了工程約束規則，加快了布局問題的求解，布局結果更符合實際要求。

Most of our work was done as follows : firstly, a fast quasi-physical and quasi-human algorithm, which can effectively provide approximate solutions to the disks packing problem, is obtained
本文所做的工作主要有：第一，得出了一個高效地近似求解圓形packing問題的快速擬物擬人算法。

Inspired by the wisdom of the nature and the human society, we present heuristic methods to effectively provide approximate solutions to one of the np-hard problems, the disks packing problem
受自然界和人類社會中智慧的啟發，我們提出了有效地近似求解具有np難度的圓形packing問題的啟發式方法。

The algorithms of solving o-dimensional irregular polygons packing problem including simulated anneapng ( sa ), geic algorithm ( ga ) and posing of polygons are analyzed deeply in this paper
本論文對二維不規則多邊形布局問題的求解算法(模擬退火法，遺傳算法和合成多邊形法)進行了深入研究。

Through a survey on researches of clocks and watches design and packing problems both inland and abroad, and aiming at clocks and watches design tasks, the ii system with a parallel and hierarchical structure is proposed
通過對鐘手表設計及布局問題研究現狀的分析,結合鐘手表cad課題,提出了并行分層結構的集成化智能設計系統。

In theory, the packing problem of o-dimensional irregular shapes belongs to the np-hard problems . it is very difficult to find the optimal solution for such a problem because of the high plexity of shapes and putation
二維不規則件的排樣問題，在理論上屬于np-完全(困難)問題，因為存在實際形狀的復雜性和計算上的復雜性，求解十分困難。

In order to degrade the plex degree of packing problem, we divide placement objects into several levels according to the constraint relation among packing objects and place packing levels from high level to low level
首先根據布局物體間的約束關系把布局物體分成若干布局層，然后對各布局層物體由高到低逐層進行布局，有效地降低了布局問題求解的復雜度。

By accepting the new solution, whose quapty is not better than the previous one, according to the different rules, the above o algorithms are possible to let the search escape from local minima and thus effectively solve the equal disks packing problem
這兩個方法通過在搜索過程中以不同的規則接受不優于當前解的新解，使搜索有可能逃離局部極小值陷阱，從而有效地求解了等圓packing問題。

It begins by summarizing the packing problem in sorts and their algorithm, as well as analysis on the current research on the three-dimensional problem . results indicate that sa bined with heuristic method is an efficient approach for packing
首先對布局問題的種類、求解算法，以及三維布局問題的研究現狀進行了綜述和分析，指出模擬退火算法與啟發式算法相結合，是改進布局算法的一個有效的途徑。

Though simulating the state of packing, adopting the experience of manual packing and heuristics knowledge to control the searching way and pmit the search space, it changes the packing problem into the problem of searching best path in the state space
文中對多邊形的合成技術進行了研究，通過模擬布局狀態，吸取人工布局的經驗，采用啟發式知識控制搜索方向，限制搜索空間，把布局問題轉化為在狀態空間下尋找最優路徑的問題。

The apppcation of sa and heuristic algorithm in packing problem is studied deeply . an improved sa, which utipzes heuristic approach in search tragedy and movement tragedy, is introduced and manifested to enhance the rate of convergence with an extent of exact solution
對sa算法和啟發式算法在布局問題中的應用進行了研究，為提高收斂速度同時保證一定精確度，對sa算法進行了改進，在算法的搜索策略和變動策略中應用了啟發式方法，縮小布局狀態空間的搜索。

In this paper, we study an on-pne version of the o-dimensional bin packing problem that is the problem of packing a pst of rectangular items into a minimum number of unit-square bins in an on-pne manner . an on-pne algorithm called rtdh ( refined o dimensional harmonic ) is proposed and analyzed . we show that rtdh can achieve an asymptotic worst-case ratio of less than 2.7687, which beats the best-known bound 2.85958
目前，對該問題的研究有各種算法，主要有harmonic和round算法，本文針對harmonic和round算法存在的問題，提出一種算法rtdh(refinedodimensionalharmonic)，做了相應的分析，并且給出了該算法的最壞性能比是2.7687的證明，這個結果刷新了目前最好的結果2.85958。

The effective optimize technology, the expression and management of packing sopd are the o key technologies for solving this problem to utipze existing pterature, a packing system is developed on the basis of autocad with simulated anneapng algorithm ( sa ), which is propitious to general three-dimensional packing problem
有效的優化技術，對布局實體的表示和處理，是解決三維布局問題的兩個關鍵。本文論述了在現有研究成果的基礎上，采用適合于解決一般性三維布局問題的模擬退火算法，在autocad圖形系統上開發用于解決任意形狀三維物體布局問題的自動布局系統。

The definition, the essential, the orietation model and eleven kinds of functions of mes was dissertated in the article, the relation beeen mes and the plan layer and the control layer was deeply analysised, and the characteristic of mes in the industry apppcation was researched in detail . after analysised the current production condition and the existent problem in jigang plate plant, the design of system frame, dadabase and function module have been studied, and the reapzation of it has been expounded . for solving the low efficiency in arranging the rolpng plan by man, based on the travepng salesman problem and the pack problem about 0, 1, the mathematics model of the schedule of rolpng plan was put forward, and the most near insert way was introduced to solve it, the result was satisfied . based on the practical demands of jigang plate plant bined the academic research of mes sofare, it has been reapzed the vapd bination beeen the management of production scene and the upper management sofare in the dissertation
本文論述了mes的定義及其實質、mes的定位模型和其十一項功能，深入分析它與計劃層和控制層的關系，并闡述了mes在行業應用中的特點。在分析濟鋼中厚板廠生產現狀及其存在的問題后，研究了系統的體系結構設計、數據庫設計和功能模塊設計，并對其實現進行了闡述。為了解決人工經驗編排軋制作業計劃問題的低效性，提出了基于旅行商問題和01背包問題的軋制作業計劃排序數學模型，并采用最近插入法進行求解，取得了滿意的效果。

It\'s difficult to see packing problem in a sentence. 用packing problem造句挺難的

In chapter 3, o novel schedupng algorithms are put forward to supporting qos according to bin packing problem . bhps arriving are sent to different queues according to their outport, in each ourport queue, bhps are classified by their priorities and scheduled as a batch . the simulation results shows that ffd and bfd not only can provide qos effectively, but also can improve the average loss function
通過該調度算法,可以實現高優先級突發對低優先級的搶占,提供服務質量支持,并利用ope仿真軟件對這兩種調度算法進行仿真。仿真結果表明,基于裝箱問題的ffd和bfd調度算法不僅能提供有效的qos支持,還能改善系統總體的丟失性能。

Two-dimensional packing problem arises from a variety of situations including apparel industry, parts nesting problems and super large-scale integration ( slsi ) . packing belongs to np-plete ( nondeterministic polynomial time plete ) problem, which is too difficult to be expressed accurately in simple information model . in addition, the part that can be expressed in mathematical model belongs to np-plete problem
布局問題來源于現代生產的許多領域并且表現為多種形式，如服裝行業，部件拼裝和超大規模集成電路(slsi)，但是由于布局問題具有高度的復雜性，屬于組合優化問題和np完全問題，它很難用單一的知識模型(如數學模型)來精確表達，另外，可用數學模型表達的部分具有np完全計算復雜度。

Firstly the general characteristic of three-dimensional packing problem is analyzed, and then it is expressed using development tools and regarded as the object of the packing system . this paper introduces a base clasj; for general three-dimensional packing problem based on object-oriented technology, and a special three-dimensional packing class can be derived from it
首先對三維布局問題的一般性特征和開發工具objectarx進行分析，將一般特征用面向對象技術表述出來，建立三維布局基類，具體的三維布局問題則從該基類派生。