combinational problem 中文意思是什麼

combinational problem 解釋
組合問題
  • combinational : 組合的
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. It is widely applied to the domain of combinational evolutionary problem seeking, self - adapt controlling, planning devising, machine learning and artificial life etc. however, there are multi - objective attributes in real - world optimization problems that always conflict, so the multi - objective genetic algorithm ( moga ) is put forward. moga can deal simultaneously with many objections, and find gradually pareto - optimal solutions

    由於現實世界中存在的問題往往呈現為多目標屬性，而且需要優化的多個目標之間又是相互沖突的，從而多目標遺傳演算法應運而生，它使得進化群體并行搜尋多個目標，並逐漸找到問題的最優解。
  2. In addition, in consideration of the non - convex and non - concave nature of the combinational optimization sub - problem, the branch and bound technique is adopted to obtain or approximate the global optimal solution

    針對組合優化子問題的非凸非凹性，採用分支定界法，以求得或接近全局最優解。
  3. Combinational analysis for a class of set covering problem

    一類覆蓋問題的組合學分析
分享友人
分享到 Line

分享到臉書