knapsack problem 中文意思是什麼

knapsack problem 解釋
背包問題, 漸縮問題
  • knapsack : n. （軍用或旅行用）背包。
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. A study on knapsack problem by genetic algorithm

    遺傳演算法在求解背包問題中的應用
  2. A study on knapsack problem by genetic algorithms

    遺傳演算法在求解背包問題中的應用
  3. Solve knapsack problem by semi - feasible genetic algorithm

    背包問題的遺傳演算法求解
  4. A hybrid genetic algorithm for solving 0 - 1 knapsack problem

    1背包問題的混合遺傳演算法
  5. Nonlinear reductive dimension approximate algorithm for 0 - 1 knapsack problem

    1背包問題的非線性降維近似演算法
  6. Heuristics algorithm for knapsack problem based on the tabu search

    基於禁忌搜索的啟發式求解背包問題演算法
  7. By making use of simulated annealing algorithm with memory, and determining a set of effective cooling schedule, the thesis solves this complex and special knapsack problem successfully

    本文應用帶記憶功能的模擬退火演算法，結合理論分析和經驗法則，通過大量試驗確定了一組有效的冷卻進度表參數，成功地解決了這個復雜而特殊的背包問題。
  8. Gga has been applied successfully in some optimization applications, for example knapsack problem and travelling salesman problem etc. in second chapter, we first introduce how to construct a goog - point set and the steps to solve problem. then give an example of how to arrange sports items in a track and field game to use gga in the end

    它採用數論中佳點集的方法來構造新的遺傳運算元，利用佳點集的性質和特點來提高演算法的效率和收斂性，並且已經成功的在一些優化問題中得到了應用，例如背包、貨郎擔等典型的np難問題。
  9. It confirms the movement equation of particle and adopts death penalty function to deal with all constraint term, and provides with the step of algorithms to solve 0 / 1 knapsack problem

    確定了該演算法中粒子的運動方程，採用死亡罰函數法處理了約束條件，給出了該演算法求解0 / 1背包問題的實現步驟，並對實驗數據進行了測試。
  10. The simulation result indicates that the performance of bspso on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms

    測試結果表明：採用該演算法求解0 / 1背包問題所得的最優解明顯優于貪婪演算法和遺傳演算法，且有較快的收斂速度。
  11. Proposing the multilevel indexing structure and algorithm that can effectively handle the huge user - profile files, and adopts the model of knapsack problem to solve the problem for providing suitable volume of information to users

    提出了可以高效處理大量user - profile文件的多級索引結構及演算法，用背包問題模型來解決給用戶提供恰當數量信息的問題。
  12. A survey on the multi - dimensional 0 - 1 knapsack problem with genetic algorithms

    1背包問題的混合遺傳演算法
  13. On the improvement of hybrid genetic algorithms for 0 - 1 ' s knapsack problem

    1背包問題的混合遺傳演算法的改進
  14. A coevolutionary genetic algorithm for 0 - 1 knapsack - problem

    1背包問題的共同進化遺傳演算法
  15. Genetic algorithm for multi knapsack problem

    多背包問題的遺傳演算法求解
  16. A rigorous method for solving 0 - 1 polynomial knapsack problem

    1多項式背包問題的一種精確演算法
  17. Ant colony algorithm for 0 1 knapsack problem

    1背包問題的蟻群方法
  18. Multipe - choice knapsack problem using multi - group genetic

    多重群體遺傳演算法在多選擇背包問題中的應用
  19. The proposed algorithm for knapsack problem is based on mimd. the sort algorithm by sampling is introduced in the sorting stage. the stages of generating subset - sum and searching are also optimized

    并行背包演算法基於mimd結構，在排序過程中引入基於采樣的排序演算法，然後對子集和生成和搜索過程加以優化。
  20. After the existing algorithms for knapsack problem and selecting the base point of ecc over gf ( p ) are deeply analyzed, a parallel algorithm for knapsack problem and that of selecting the base point of ecc are respectively proposed

    在深入分析背包問題的現有并行演算法和gf （ p ）上ecc的基點選取演算法性能的基礎上，分別提出一種基於采樣和mimd結構的背包問題并行演算法和gf （ p ）上ecc的并行基點選取演算法。
分享友人
分享到 Line

分享到臉書