背包問題 的英文怎麼說

中文拼音 [bēibāowèntí]
背包問題 英文
knapsack problem
  • 背 : 背動詞1. （用脊背馱） carry on the back 2. （擔負） bear; shoulder
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 背包 : （行軍或外出時背在背上的衣服包裹） knapsack; rucksack; infantry pack; field pack blanket roll; wallet; packsack
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  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. Knapsack ' s solution based on genetic algorithms

    基於遺傳演算法的背包問題求解
  6. Nonlinear reductive dimension approximate algorithm for 0 - 1 knapsack problem

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

    基於禁忌搜索的啟發式求解背包問題演算法
  8. 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

    本文應用帶記憶功能的模擬退火演算法，結合理論分析和經驗法則，通過大量試驗確定了一組有效的冷卻進度表參數，成功地解決了這個復雜而特殊的背包問題。
  9. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  10. 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背包問題的實現步驟，並對實驗數據進行了測試。
  11. 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背包問題所得的最優解明顯優于貪婪演算法和遺傳演算法，且有較快的收斂速度。
  12. Aimed at the 0 - 1 knapsack problems, the article proposes a kind of hybrid intelligence algorithm combining with the adjusting strategy, the greedy algorithm and the binary particle swarm optimization algorithm

    摘要針對0 - 1背包問題，提出一種具有修復策略的、貪心演算法與二進制粒子群演算法相結合的混合智能演算法。
  13. A kind of hybrid particle swarm optimization algorithm for solving 0 - 1 knapsack problems

    1背包問題的混合粒子群演算法
  14. 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文件的多級索引結構及演算法，用背包問題模型來解決給用戶提供恰當數量信息的問題。
  15. A survey on the multi - dimensional 0 - 1 knapsack problem with genetic algorithms

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

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

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

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

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

    1背包問題的蟻群方法
分享友人
分享到 Line

分享到臉書