combinatorial problem 中文意思是什麼

combinatorial problem 解釋
組合問題
  • combinatorial : 組合的
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. Vsp is both a pivotal tache in logistic distribution optimization and indispensable in electronic commerce. it can increase logistic economic benefit and realize logistic rationalization. the systemic study on the theory and method of vsp is the base on the growth of logistic intensivism, the establishment of modem chain of command, the development of its and ec. now, the problem is not only applied to the field of auto transportation, but also to ship avigation communication electricity industry management computer application etc. the algorithm has been applied into many combinatorial optimization problems such as the trainman ' s shift arrangement in avigation the optimization design of cargo arrangement in ship company

    對貨運車輛進行調度優化，可以提高物流經濟效益、實現物流科學化。對貨運車輛調度優化理論與方法進行系統研究是物流集約化發展、建立現代調度指揮系統、發展智能交通運輸系統和開展電子商務的基礎。目前，問題的形式已有很大發展，該問題以不僅僅局限於汽車運輸領域，在水運、航空、通訊、電力、工業管理、計算機應用等領域也有一定的應用，其演算法已用於航空乘務員輪班安排、輪船公司運送貨物經過港口與貨物安排的優化設計、交通車線路安排、生產系統中的計劃與控制等多種組合優化問題。
  2. This is a combinatorial problem in canonical form.

    這是組合論中的典型問題。
  3. A problem in combinatorial geometry about convex polygon

    邊形的一個組合幾何問題
  4. On the part of the design of nine - component thrust vector stand, an automatic hydraulic pressure original position calibration system, a scheme of original position calibration, and the great rigidity universal flexible combinatorial underprop are designed. by using the scheme of “ universal flexible combinatorial underprop plus software digital filter ”, the inherent frequency of test stand is improved, and the problem of test stand libration is solved. then, the resolving method of the disturbance between underprops of the moveable frame is proposed, and the disturbance revise equation is deduced

    在推力矢量試車臺設計方面，設計了自動液壓原位校準系統、原位校準方案以及大剛度萬向柔性組合支撐;採用「萬向柔性組合支撐+軟體數字濾波」的方案，提高了試車臺動架的固有頻率，解決了試車臺動架的振動問題;提出了動架約束互擾問題的解決方法，推導了互擾修正方程;研究了九分力推力矢量測量誤差分析方法，並計算了推力矢量測量精度。
  5. Dp technique is a high efficiency algorithm to solve combinatorial optimization problems by divided the multidimensional problem into multiple 1 - dimension problems. when this technique resorts to accumulate multiple frames, there are some disadvantages

    動態規劃演算法是一種解決組合尋優問題的高效演算法，通過將n維問題變換為n個一維優化問題，一個一個地求解的方法，很好的提高了效率。
  6. The parallel combinatorial spread spectrum provides high spectral efficiency and the data rate of the parallel combinatorial spread spectrum is higher than that of the direct sequence spread spectrum. this thesis studies on the mapping between data and spread sequence in the parallel combinatorial spread spectrum system and presents a mapping method based on the lexicographic order. the mapping method resolves the many to one mapping problem of the past method

    本文研究了并行組合擴頻中數據和擴頻序列之間的映射方法，指出了已有的一種不定方程求解演算法中存在的映射不唯一問題，應用組合數學中的相關理論，將映射問題轉化為廠組合問題，提出了基於字典順序的并行組合擴頻數據映射演算法，該演算法具有普遍性，解決了原有演算法中的多一映射問題。
  7. Inter - relations among collaborative discussion, meta - cognitive control and successful solution in combinatorial problem

    合作討論和元認知監控與排列組合問題的解決
  8. It can be boiled down to combinatorial optimization problem in mathematics. on the basis of summarizing the complexity and structural features of hmb and rules of its design and manufacture and analyzing the spatial relationship in 3d layout of hmb, the expressions of relevant variants are put forward using the object - oriented approach

    在全面總結液壓集成塊設計問題的復雜性特點，以及集成塊類零部件的結構特徵和設計、製造信息組成規律的基礎上，本文深入分析了集成塊立體布局的空間關系，用面向對象方法定義了與該問題有關的特徵變量的示性表達式，給出優化目標和約束條件，進而確立了集成塊設計問題的數學優化模型。
  9. Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm, the present of the general searching algorithm is the apparent progress for the searching technology

    因為組合問題的狀態空間表示比原來的搜索求解容易的多，通用搜索演算法的提出是搜索技術的一個明顯的進步。
  10. The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem

    摘要煉鋼-連鑄生產的澆次組合與排序是帶有工藝約束的并行機流水車間調度問題。
  11. Traveling salesman problem is combinatorial optimization problem in graph theory, it has npc computation complexity, and lots of problem can transfer to traveling salesman problem. the computation of tsp is analyzed, then the hopfield network method for solving tsp is given, at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling

    首先分析了旅行商問題在窮舉搜索法下的工作量；其次給出了求解旅行商問題的hopfield神經網路方法，同時分析了利用人工神經網路求解旅行商問題所存在的問題；最後利用混飩神經網路模型求解10城市旅行商問題和中國旅行商問題。
  12. It is verified that this method enables scheme solving to be implemented with a better operability, which offers a promising way to solve combinatorial explosion problem in conceptual design

    研究表明，該方法是合理可行的，它可以使方案求解的人工尋優過程實現演算法化，並具有較好的可操作性，從而為解決方案優化的組合爆炸問題提供了一種新的思路。
  13. On the vehicle dispatching problem in combinatorial optimization

    關于組合優化中的車輛調度問題
  14. This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search

    本文提出了將組合問題歸結為狀態空間搜索問題的數學模型和通用演算法。
  15. The program of state space to solve one combinatorial problem is made up of the general searching module and one module of material problem. the different material problems have different modules, but the general searching module does not vary with the problems

    一個組合問題的狀態空間求解程序由通用搜索模塊加上一個問題描述模塊組成，不同問題具有不同的問題描述模塊，通用搜索模塊不隨問題的改變而改變。
  16. Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm

    成組技術問題是組合優化問題，而遺傳演算法正是目前求解組合最優化的有效方法之一。
  17. Three - dimensional component packing is a combinatorial optimization and np - complete problem. it is difficult to find its exact global optimum

    三維布局問題屬于組合最優化問題和np完全問題，在一定時間內求其精確全局最優解是相當困難的。
  18. This problem has vide applications in real areas, such as the design of water and electricity supply networks, and communication networks, etc. at the same time, the problem is also closely related with some classical combinatorial optimization problems, including the steiner problem and the travelling salesman problem, which are well - known. so, it is of great importance to study it

    所謂歐幾里德2 -連通steiner網路問題，就是對于給定的平面點集p ，確定它的長度最小的2 -連通steiner網路，該問題與組合最優化中著名的steiner問題和旅行售貨員問題有關，同時在水、電供應網路和通訊網路等設計中也有非常廣泛的應用，所以對該問題的研究具有重要的意義。
  19. Three - dimensional packing ( tdp ) is a combinatorial optimization and hp - complete problem and applied widely to the mechanical manufacture and traffic transportation industries. up to now there are varieties of heuristic algorithms to solve the tdp because of its high complication, we discuss the heuristic algorithm deeply in this paper and apply the simulated annealing ( sa ) algorithm to the packing system

    三維布局問題屬于組合最優化問題和np完全問題，具有高度復雜性，用一般的數學方法根本無法求解，目前解決三維布局問題多為各種啟發式方法，本文在對啟發式方法進行深入探討的基礎上，採用了用於解決一般三維布局問題的模擬退火演算法作為布局系統的操作演算法。
  20. Supposed algorithm b is the concrete searching algorithm for the combinatorial problem p. the parameter of algorithm a corresponding to algorithm b is the algorithm that denotes the combinatorial problem p in the way of the state space

    設b是求解組合問題p的具體搜索演算法，演算法a對應于演算法b的參數就是用狀態空間表示組合問題p的演算法。
分享友人
分享到 Line

分享到臉書