What do you get if you follow the greedy algorithm? What's the first thing the thief does?
如果年贪婪算法你会带走什么呢？，这个贼做的第一件事是什么？
We'll start with the greedy thief. Well, the greedy thief follows the greedy algorithm.
我们从贪婪的贼开始，这个贪婪的贼按贪婪算法行动。
An improved particle swarm optimization algorithm embedded with greedy search for solution of unit commitment.
求解机组组合问题的嵌入贪婪搜索机制的改进粒子群优化算法。
Should I expect to have exactly same match everytime I run the match with greedy algorithm?
我应该会有完全相同的比赛，每次运行与贪婪算法？
A greedy algorithm used to Solve the design problem of digital communication network in power system is proposed.
本文提出用贪心算法解决电力系统数据通信网的设计问题。
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.
因此本文针对标的本身的结构提出了四种启发式信息及两种求解器：二元蚁群算法及贪婪算法。
The generalization of set cover greedy algorithm is used to solve the redundant test set problem arising in bioinformatics.
集合覆盖贪心算法的推广被用来求解生物信息学中出现的冗余测试集问题。
Improve a greedy algorithm for discretization of continuous attribute.
改进了连续属性离散化的贪心算法。
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.
在调度约束条件分析和一些基本假设的基础上，本文建立了多卫星初始调度约束模型，并给出了模型求解的贪婪算法。
Compared with the greedy algorithm, this approach can get good solution for embedded system in timely manner.
与贪心算法相比，该方法可以在合理的时间内为嵌入式系统寻找到满意的解决方案。
A mathematical model is firstly proposed. Then the greedy heuristic algorithm is applied to solve the model.
首先建立此问题的数学模型，并采用启发式贪心算法对模型进行求解。
An ideal result can be obtained by using second-order greedy algorithm.
用二次贪心算法求解，可获得比较理想的结果。
The complexity of GCDG is compared with both exhaustive search algorithm and traditional greedy search algorithm, and then its efficiency is proved in the small alarm overlapped domain.
通过分析对比该算法与完全搜索算法和传统贪心算法的复杂性，证明了其在故障告警域重叠度较小情况下的有效性。
We proposed a decorrelating multiuser detection based on greedy algorithm for CDMA communication.
在此，提出了一种基于贪心算法的解相关CDMA多用户检测方法。
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.
针对矩形件排样优化问题，分析了传统近似算法的主要缺陷，在此基础上，提出一种新的排样算法——贪婪算法。
It is, of course, very easy to improve the efficiency of the greedy algorithm.
当然，贪婪演算法的有效性是很容易改进的。
Greedy algorithm achieves low cost multicast tree whose delay performance is worse than other trees.
贪婪算法是一种动态组播路由算法，该算法获得的通信树时延较大。
In our actual test experiments, each instance can be completed better by delimitation greedy algorithm than hitting set 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.
通过对信道状态信息进行判断，利用贪婪算法将用户子载波分配的比特取整，以实现系统功率最小化。
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.
许多采用贪婪策略作为其基本数据转发机制的地理路由算法都不可避免会遇到路由空洞现象。
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.
分析了产品实际拆卸过程中的不确定性，将实际产品拆卸序列规划转化为一类贪婪算法求解问题。
For the parsimony this paper presents model a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。
For MQAM modulation, the optimized bit loading and power allocation were derived from a various-step greedy algorithm.
针对MQAM调制，采用变步长的贪婪算法得到优化的子信道比特加载及功率分配方案。
The algorithm adopts neighborhood definition, the main idea is that to give a full array of all cities, and so full array of command to generate a loop with a greedy 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.
在研究分析计算网格作业调度算法现有成果的基础上，本文提出了一种基于贪心策略的调度算法和一种自适应调度算法。
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;
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
Then, considering complexity of greedy algorithm, this paper proposes a modified greedy algorithm.
该算法通过修改迭代过程的初始条件，大大简化了贪婪算法的计算复杂度。
Then, considering complexity of greedy algorithm, this paper proposes a modified greedy algorithm.
该算法通过修改迭代过程的初始条件，大大简化了贪婪算法的计算复杂度。
应用推荐