Lookahead search is a well-known technique for improving greedy algorithms.
对于贪婪算法的改进，前向搜索是一种众所周知的技术。
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
Through analyzing relation judgment matrix, consistency matrix, induced matrix and measure matrix, a prediction accelerating greedy algorithms to rectified element is put forword.
通过分析判断矩阵，一致性矩阵，导出矩阵及度量矩阵的关系，提出一种修改判断矩阵的预测加速修正的贪婪算法。
This paper adopts dynamic programming method and greedy method to solve such problems, then analyzes and compares the differences of two algorithms.
采用动态规划法和贪心法对该问题进行求解，分析和比较这两种算法在求解同一问题时的差异。
However, the problem that most of the geographic routing algorithms which adopt greedy algorithm as their basic routing strategies have to face is the routing void phenomena.
许多采用贪婪策略作为其基本数据转发机制的地理路由算法都不可避免会遇到路由空洞现象。
At the same time, the branch-and-bound algorithm and greedy algorithm are developed to solve the model, and a numerical example is given to illustrate and test the algorithms.
同时给出了求解该模型的分支定界算法和贪婪算法，并通过一个数值例子说明和检验以上算法。
Referring current research results on job scheduling algorithms in grid environments, this paper proposes a job scheduling algorithm based on greedy strategy and a self-adaptive algorithm.
在研究分析计算网格作业调度算法现有成果的基础上，本文提出了一种基于贪心策略的调度算法和一种自适应调度算法。
Referring current research results on job scheduling algorithms in grid environments, this paper proposes a job scheduling algorithm based on greedy strategy and a self-adaptive algorithm.
在研究分析计算网格作业调度算法现有成果的基础上，本文提出了一种基于贪心策略的调度算法和一种自适应调度算法。
应用推荐