Combined withgreedy algorithm and enumeration algorithm,the algorithm is improved in precision and real-time.

This paper introduces the basic ideas of genetic algorithm,greedy algorithm,stimulated annealing and tabu search briefly and expounds the m.

The knapsack problem is a classical question in the area of algorithm design and analysis, in this paper greedy method, the dynamic programming method and the recursion method are used separately to solve the knapsack problem, 0-1 knapsack problem and the simple 0-1 knapsack problem, and to design the algorithm, to discuss the time complexity.

By means of combination of simplex method and greedy method,have obtained the optimization solution or satisfactory solution.

Iterative-weighted Greedy Algorithm to InSAR Phase Unwrapping and Performance Analysis;

Research and implementation of automatic course system based on greedy algorithm;

Hardware/software partitioning based on a parallel K-means clustering and greedy algorithm;

Solve 0/1 Knapsack Problem by a Hybrid Genetic Algorithm Based on Greed Algorithm;

Research of improved greed algorithm used in blogsphere outbreak detection;

This paper according to the aims presented by covariance control,begins with the greed algorithm and studies the use of two kinds of super-heuristic algorithms,greed/uniform and greed/order,in selecting sensor sets algorithm to reduce the computational complexity.

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.