贪心算法

在此，提出了一种基于贪心算法的解相关CDMA多用户检测方法。

We proposed a decorrelating multiuser detection based on greedy algorithm for CDMA communication .

基于贪心算法提出了一种改进的求解旅行商问题（TSP）的拟人算法。

In this paper , a personification algorithm for solving the Traveling Salesman Problem ( TSP ) is proposed , which is based on original greedy algorithm .

基于给出的AOViewGraph模型，提出了一个考虑维护代价并具有固定比值界的贪心算法，来实现实视图的选择。

Different algorithms for the materialized view selection based on AO View Graph model are given .

本文使用贪心算法动态的确定k值，采用满足查询代价给定的限制下，使维护代价最小的选择原则。

The value of " k " is attained dynamically according to the minimizing maintenance cost under given query cost in the dissertation .

本文主要通过对迪杰斯特（dijkstra）算法的分析和改进实现来应用贪心算法解决实际问题。

This text has mainly analysed and improved on Dijkstra arithmatic to apply cupidity arithmatic .

本论文以数据集市为基础，通过引入粗糙集理论和贪心算法，在研究生院局域网环境下完成了一个C／S模式的教务排课系统的分析、设计与实现。

Based on the data market and through the theory of rough set and greed algorithm , this paper describes the analysis , designation and realization of a c / s mode scheduling system in the environment of a graduate school local loop .

介绍了求解货郎问题的4个算法：贪心算法、MST近似算法、MM近似算法和回溯搜索算法。

Four algorithms of traveling salesman problem ( i.e. TSP ) solving are introduced , including : greedy algorithm ? MST approximation algorithm ? MM approximation algorithm and backtracking search algorithm .

提出了利用贪心算法更新Gabor小波特征模板的方法，通过对误差函数最小化实现自适应修正目标特征点位置。

The deformable Gabor wavelet character template is presented by using the esurience algorithm . This algorithm can modify position of target characters self adaptively by minimizing the error function .

Kempe证明影响最大化是NP-hard，并提出了贪心算法，具有较好结果。

Kempe proved that this problem is NP-hard , and made a greedy algorithm , with better results .

采用贪心算法实现了Snake边缘检测模型，分别用该模型和基于边缘梯度扫描的算法识别5种典型印花织物悬垂边缘，并将2种算法得到的边缘轮廓进行了比较。

A Snake edge detection model is implemented by greedy arithmetic , and then the drape contours of 5 typical printing fabrics detected by this model are compared with the contours extracted by edge gradient scanning .

贪心算法求解k-median问题

Greedy Algorithms for K-median Problems

在原始的LatentSVM模型训练方法中，首先根据样本图像的HOG特征由SVM算法获得简单的分类模板，然后再对分类模板使用贪心算法自动生成隐变量。

In the original Latent SVM model training process , a simple classification template is trained from sample HOG features by SVM algorithm . Then a greedy algorithm is conducted with the classification template to obtain the hidden variables .

解决MDAP的一种贪心算法

A greedy algorithm for mdap

另外，给出了集合覆盖贪心算法对冗余度为n1的加权冗余测试集问题的近似比的紧密下界（2o（1））lnn（1）。

In addition , this paper shows the tight lower bound ( 2 o ( 1 )) lnn ( 1 ) of the approximation ratio of set cover greedy algorithm for the weighted redundant test set with redundancy n 1 .

主要讨论了公制空间和非公制空间初始解的产生，用贪心算法解k-median问题以及全局最优解的计算。

This paper mainly discusses generation methods of the initial solution in metric space and no - metric space , greedy algorithms for k-median problems and the computation of global optimization .

目前已有很多方法来约简测试用例集，其中包括很多启发式算法：如贪心算法、HGS算法、GRE算法、GE算法等，实验证明这些方法都可以有效的约简测试用例集的规模。

There are many methods used for reduction of test cases , including many heuristic algorithms : such as greedy algorithms , HGS algorithm , GRE algorithm , GE algorithm , experiments prove that these methods can reduce the test cases effectively .

介绍通过应用贪心算法中的最小生成树问题的prim算法，来解决机关单位、公司、学校等地方的暖气供应的问题。

The paper introduces an application of using prim algorithm that is in the greedy algorithm , and this algorithm helps to solve the problem of supplies of central heating that exists in many places such as departments , companies , schools , etc.

作者借助多阶段决策方法和贪心算法，设计出一种6∶8优化映射等重调制码（OCWMC）。

Therefore , a 6 ∶ 8 optimal mapping constant weight modulation code ( OCWMC ) is designed by the multistage decision method and the greedy algorithm .

试验结果表明：贪心算法解公制空间的k-median问题效果要好于解非公制空间的k-median问题；用贪心算法解公制空间和非公制空间k-median问题都能得到较好的结果。

The testing data shows : the result of greedy algorithms for metric k-median problems is better than that of no-metric k-median problems and we can get a better result using greedy algorithms for metric and no-metric k-median problems .

本文针对OVSF-CDMA和MC-CDMA蜂窝通信系统的下行链路，提出了一种基于贪心算法的速率分配方案，并从理论上证明了该方案能够以最小的基站总发射功率提供最大的系统吞吐率。

In this thesis , for the downlink of OVSF-CDMA and MC-CDMA cellular systems , a rate assignment algorithm , i.e. GRS ( Greedy Rate Scheduling ) scheme , is proposed . It is proved that the GRS can maximize system throughput while simultaneously minimizing the transmission powers .

一维下料方案的贪心算法优化

Optimization for One Dimensional Cutting Stock Problem Based on Greedy Algorithms

贪心算法用于图的染色问题是一种简单的近似方法。

Greedy algorithm is a simple approximative method in graph coloring .

电力系统；集中型计算机通信网络；最优设计；贪心算法；

Power system Concentrated computer Communication network Optimal design Greedy algorithm ;

测试集问题的集合覆盖贪心算法的深入近似

Deep Approximation of Set Cover Greedy Algorithm for Test Set

改进了连续属性离散化的贪心算法。

Improve a greedy algorithm for discretization of continuous attribute .

最长d维箱嵌套问题的贪心算法

The Greedy Algorithm of the Longest Nesting of d-Dimension Boxes

顶点覆盖问题的贪心算法的设计与分析

Design and analysis of vertex covered problem by greedy algorithm

0/1背包问题的贪心算法

Greedy algorithm for the solution of the question of 0 / 1 knapsack

柔性流水作业排序问题的贪心算法求解

Greedy Algorithm Solution of Flexible Flow Shop Scheduling Problem

关于决策表离散化贪心算法的进一步改进

More improved greedy algorithm for discretization of decision table