Improve a greedy algorithm for discretization of continuous attribute.
改进了连续属性离散化的贪心算法。
An ideal result can be obtained by using second-order greedy algorithm.
用二次贪心算法求解，可获得比较理想的结果。
The greedy algorithm gets solution of a problem through a series of choices.
贪心算法是通过一系列的选择来得到一个问题的解。
However, in most cases, the tree constructed by greedy algorithm is not optimal globally.
然而，在大多数情况下，贪婪算法构造的树不是全局最优的。
We proposed a decorrelating multiuser detection based on greedy algorithm for CDMA communication.
在此，提出了一种基于贪心算法的解相关CDMA多用户检测方法。
Then, considering complexity of greedy algorithm, this paper proposes a modified greedy algorithm.
该算法通过修改迭代过程的初始条件，大大简化了贪婪算法的计算复杂度。
Compared with the greedy algorithm, this approach can get good solution for embedded system in timely manner.
与贪心算法相比，该方法可以在合理的时间内为嵌入式系统寻找到满意的解决方案。
A greedy algorithm used to Solve the design problem of digital communication network in power system is proposed.
本文提出用贪心算法解决电力系统数据通信网的设计问题。
For MQAM modulation, the optimized bit loading and power allocation were derived from a various-step greedy algorithm.
针对MQAM调制，采用变步长的贪婪算法得到优化的子信道比特加载及功率分配方案。
The generalization of set cover greedy algorithm is used to solve the redundant test set problem arising in bioinformatics.
集合覆盖贪心算法的推广被用来求解生物信息学中出现的冗余测试集问题。
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.
目前存在的决策树归纳算法大多数是基于自顶向下的贪婪算法，它在每个结点都执行一个局部最优决策。
At the same time, a large number of experimental data shows that the delimitation greedy algorithm has better results than the hitting set algorithm.
同时大量实验数据表明，定界贪心算法与碰集算法相比具有更好的计算性能。
In this paper, a personification algorithm for solving the Traveling Salesman Problem (TSP) is proposed, which is based on original greedy algorithm.
基于贪心算法提出了一种改进的求解旅行商问题(tsp)的拟人算法。
In order to improve the precision of phase unwrapping in InSAR data processing, a new method is presented based on iterative-weighted greedy algorithm.
该文针对干涉SAR二维相位解缠问题，提出了一种利用贪婪算法提高解缠精度的新方法。
Then, the bit was rounded by the greedy algorithm with the channel state information judgment, to obtain the minimized transmission power of the system.
通过对信道状态信息进行判断，利用贪婪算法将用户子载波分配的比特取整，以实现系统功率最小化。
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.
分析了产品实际拆卸过程中的不确定性，将实际产品拆卸序列规划转化为一类贪婪算法求解问题。
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.
同时给出了求解该模型的分支定界算法和贪婪算法，并通过一个数值例子说明和检验以上算法。
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.
针对矩形件排样优化问题，分析了传统近似算法的主要缺陷，在此基础上，提出一种新的排样算法——贪婪算法。
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.
在调度约束条件分析和一些基本假设的基础上，本文建立了多卫星初始调度约束模型，并给出了模型求解的贪婪算法。
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.
对于一维下料问题，本文得到一个有各自交货时间的模型。针对该模型提出一种新的算法：DP贪婪算法。
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.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。
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;
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
Using the Greedy Algorithm, this paper presents a new optimal method for designing digital communication networks in power systems.
本文讨论如何用贪心算法进行电力系统数据通信网优化设计。
To address the holes problem in wireless sensor networks, a novel geographic routing algorithm, named Double Greedy algorithm (DGA), was proposed based on virtual coordinate system.
针对地理路由算法中的路由空洞问题，通过引入虚拟坐标的方式，提出了一种新颖的无线网络地理路由算法——双重贪婪算法(DGA)。
To address the holes problem in wireless sensor networks, a novel geographic routing algorithm, named Double Greedy algorithm (DGA), was proposed based on virtual coordinate system.
针对地理路由算法中的路由空洞问题，通过引入虚拟坐标的方式，提出了一种新颖的无线网络地理路由算法——双重贪婪算法(DGA)。
应用推荐