heuristic problem solving 中文意思是什麼

heuristic problem solving 解釋
啟發式問題求解
  • heuristic : n. -s 1. 啟發式教學法，啟發式的藝術[應用]。2. 【計算機】直觀推斷，試探法。adv. -ally
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  • solving : 解決問題的定勢解決問題的心向
  1. At present, however, there is still no convincible wags to mine transportation vechile scheduling, for all mathematical means we have is limited in solving this problem, and instructing science theory is wanted. in order to solve these problems, we usually with the help of heuristic method for decision - making and judgement - making in mine transportation vechile scheduling, so the development and invention of intelligence compute software is desperately needed

    礦山運輸車輛調度過程復雜多變，現有的數學方法在解決此問題時還很不完善，缺乏科學的理論作指導。這些問題的解決，往往需要用啟發式方法（ heuristicmethod ）作出決策和判斷，這就有賴于智能計算軟體的開發和研製。
  2. Solving qos multicast routing problem based on heuristic ant algorithm

    組播路由問題求解
  3. 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變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  4. Topics covered include : applications of rule chaining, heuristic search, logic, constraint propagation, constrained search, and other problem - solving paradigms, as well as applications of decision trees, neural nets, svms and other learning paradigms

    涉及的主題包括：鏈式規則的應用、啟發式搜索、邏輯、約束傳播、約束搜索和其它問題解決範例，另外還有決策樹的應用、神經網路、向量機（ svm ）以及其它學習範例。
  5. A new heuristic optimization algorithm for solving the problem was presented

    提出了解決這類問題的新的啟發式優化演算法。
  6. For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization, a heuristic search method is proposed, in which based on minimum spanning tree, degrees of vertices over the constrained degrees are reduced to the required state

    摘要針對網路設計和優化中度約束最小生成樹問題，提出了一種基於貪心思想的啟發式演算法求解度約束最小生成樹。
分享友人
分享到 Line

分享到臉書