改进了连续属性离散化的贪心算法。
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.
本文提出用贪心算法解决电力系统数据通信网的设计问题。
A greedy algorithm used to Solve the design problem of digital communication network in power system is proposed.
本文讨论如何用贪心算法进行电力系统数据通信网优化设计。
Using the Greedy Algorithm, this paper presents a new optimal method for designing digital communication networks in power systems.
在此，提出了一种基于贪心算法的解相关CDMA多用户检测方法。
We proposed a decorrelating multiuser detection based on greedy algorithm for CDMA communication.
首先建立此问题的数学模型，并采用启发式贪心算法对模型进行求解。
A mathematical model is firstly proposed. Then the greedy heuristic algorithm is applied to solve the model.
基于贪心算法提出了一种改进的求解旅行商问题(tsp)的拟人算法。
In this paper, a personification algorithm for solving the Traveling Salesman Problem (TSP) is proposed, which is based on original greedy algorithm.
集合覆盖贪心算法的推广被用来求解生物信息学中出现的冗余测试集问题。
The generalization of set cover greedy algorithm is used to solve the redundant test set problem arising in bioinformatics.
在实际测试实验中，未曾遇到定界贪心算法性能不如碰集算法性能好的实例。
In our actual test experiments, each instance can be completed better by delimitation greedy algorithm than hitting set algorithm.
同时大量实验数据表明，定界贪心算法与碰集算法相比具有更好的计算性能。
At the same time, a large number of experimental data shows that the delimitation greedy algorithm has better results than the hitting set algorithm.
与贪心算法相比，该方法可以在合理的时间内为嵌入式系统寻找到满意的解决方案。
Compared with the greedy algorithm, this approach can get good solution for embedded system in timely manner.
这些算法均属于贪心算法，存在典型的局部最小问题，是一种静态的局部最优算法。
These are all greedy which are static local optimal algorithm and have typical local optimization problem.
这些算法均属于贪心算法，存在典型的局部最小问题，而且属于一种单目标最优算法。
These algorithms all belong to greed algorithm, have the partial minimum problem, and belong to the best algorithm of single objective.
针对0-1 背包问题，提出一种具有修复策略的、贪心算法与二进制粒子群算法相结合的混合智能算法。
The simulation result indicates that the performance of BSPSO on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms.
该算法采用邻域定义，主要思想是：给定一个所有城市的全排列，依此全排列的指挥用贪心算法生成一个回路。
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.
通过分析对比该算法与完全搜索算法和传统贪心算法的复杂性，证明了其在故障告警域重叠度较小情况下的有效性。
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.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。
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 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.
应用推荐