我们从贪婪的贼开始，这个贪婪的贼按贪婪算法行动。
We'll start with the greedy thief. Well, the greedy thief follows the greedy algorithm.
另外，在算法的变异算子中还融合了贪婪算法。
Moreover, the mutation operator is added the greed algorithm.
我应该会有完全相同的比赛，每次运行与贪婪算法？
Should I expect to have exactly same match everytime I run the match with greedy algorithm?
如果年贪婪算法你会带走什么呢？，这个贼做的第一件事是什么？
What do you get if you follow the greedy algorithm? What's the first thing the thief does?
对于贪婪算法的改进，前向搜索是一种众所周知的技术。
Lookahead search is a well-known technique for improving greedy algorithms.
然而，在大多数情况下，贪婪算法构造的树不是全局最优的。
However, in most cases, the tree constructed by greedy algorithm is not optimal globally.
因为正如我们已经归越过的，对于一般连续性背包问题贪婪算法很实用。
With the continuous knapsack problem as we've formulated it, greedy is good.
贪婪算法是一种动态组播路由算法，该算法获得的通信树时延较大。
Greedy algorithm achieves low cost multicast tree whose delay performance is worse than other trees.
用改进贪婪算法来处理这种和类似问题，并阐述了“子模性”的概念。
This paper uses a new methodology which improved from normal greed algorithm for detecting this problem in this and related problems, exhibiting the property of "submodularity".
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.
该算法通过修改迭代过程的初始条件，大大简化了贪婪算法的计算复杂度。
Then, considering complexity of greedy algorithm, this paper proposes a modified greedy algorithm.
在点对合并的过程中使用八叉树结构进行空间分解，使用贪婪算法来选择点对。
Meanwhile, space decomposition was implemented by eight-branch trees structure in the process of the merger of couple-point which was selected by greedy choice algorithm.
针对MQAM调制，采用变步长的贪婪算法得到优化的子信道比特加载及功率分配方案。
For MQAM modulation, the optimized bit loading and power allocation were derived from a various-step greedy algorithm.
该文针对干涉SAR二维相位解缠问题，提出了一种利用贪婪算法提高解缠精度的新方法。
In order to improve the precision of phase unwrapping in InSAR data processing, a new method is presented based on iterative-weighted greedy algorithm.
但是让我们找一找它的一些变种，在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。
But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.
本文研究基于凸风险最小化方法的多分类贪婪算法，推广二分类的学习问题到多分类的情形。
In this paper, learning algorithm for solving multi-category classification using convex upper losses is studied.
因此本文针对标的本身的结构提出了四种启发式信息及两种求解器：二元蚁群算法及贪婪算法。
By using the intrinsic characters of this model, we design four types of heuristic information for bid and two problem solvers: the binary ant colony algorithm and the greedy algorithm.
同时给出了求解该模型的分支定界算法和贪婪算法，并通过一个数值例子说明和检验以上算法。
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.
分析了产品实际拆卸过程中的不确定性，将实际产品拆卸序列规划转化为一类贪婪算法求解问题。
By analyzing the uncertainty of product disassemble process, a product disassembly sequence planning was mapped into a problem which can be solved by greedy algorithm.
通过对信道状态信息进行判断，利用贪婪算法将用户子载波分配的比特取整，以实现系统功率最小化。
Then, the bit was rounded by the greedy algorithm with the channel state information judgment, to obtain the minimized transmission power of the system.
目前存在的决策树归纳算法大多数是基于自顶向下的贪婪算法，它在每个结点都执行一个局部最优决策。
The existing majority of the decision tree inductions are based on a top-down greedy algorithm, which make a locally optimal decision at each node.
对于一维下料问题，本文得到一个有各自交货时间的模型。针对该模型提出一种新的算法：DP贪婪算法。
As for the one-dimensional cutting problem, the paper comes up with a model of mutual deadline, in allusion to which, a new algorithm is put forward, that is, DP greedy algorithm.
论文依据贪婪算法提出了SC-FDE中的最小功率算法，该算法需要回传信息量小，计算复杂度比较低。
This algorithm has higher spectral efficiency compared with present one. According to the character of sequenced optimal signal space in SC-FDE, we propose an algorithm called minimum power algorithm.
针对矩形件排样优化问题，分析了传统近似算法的主要缺陷，在此基础上，提出一种新的排样算法——贪婪算法。
To resolve the rectangular cutting stock problem, this paper proposes a new greedy algorithm, based on analyzing the main disadvantage of the traditional approximate algorithm.
通过分析判断矩阵，一致性矩阵，导出矩阵及度量矩阵的关系，提出一种修改判断矩阵的预测加速修正的贪婪算法。
Through analyzing relation judgment matrix, consistency matrix, induced matrix and measure matrix, a prediction accelerating greedy algorithms to rectified element is put forword.
本文对基于虚拟MIMO协作多跳广播的能量最小广播问题进行了探讨，并对其经典贪婪算法GF A进行了改进。
In this paper, describe the minimum energy broadcasting problem which based virtual MIMO cooperative multihop broadcasting schedule, and improve the GFA algorithm.
在调度约束条件分析和一些基本假设的基础上，本文建立了多卫星初始调度约束模型，并给出了模型求解的贪婪算法。
A constraint satisfaction scheduling model for the initial scheduling problem and a greedy algorithm for it are given based on the constraints analysis and some basic hypothesis.
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
The new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link;
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
The new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link;
应用推荐