1) Greedy method with graded row action method
分级行处理法贪心方法
2) row action method with greedy method
行处理法贪心方法
3) column action method with greedy method
列处理法贪心方法
4) Greedy method
贪心方法
1.
This paper will introduce five algorithm design methods, which are Greedy method, Dynamic programming, Backtracking, Branch and bound, Genetic algorithm, summarize their basic tenets, give the solving algorithm thought to 0/1 knapsack problem, analyse the algorithms and put forward the improving methods.
本文分别从贪心方法、动态规划、回溯法、分枝-限界法,遗传算法这五种算法设计方法入手,概述了各种设计方法的基本原理,提出了求解0/1背包问题的算法思想,并对算法进行分析,提出了改进方法。
2.
This paper introduces the concept about the question of job scheduling with time limit, a general method of solving this question using greedy method and a fast algorithm which is improved.
介绍了带有限期作业排序问题的概念,以及使用贪心方法求解此问题的一般算法和一种改进的快速算法。
5) parallel processing method
并行处理方法
1.
A multi-computer intelligence information parallel processing method
一种多机情报信息并行处理方法
6) greedy algorithm
贪心算法
1.
Behavior analysis of electricity trade using transportation problem and greedy algorithm;
应用运输问题和贪心算法的电力交易行为分析
2.
The Method of the Downlink of Science Satellite Based on Greedy Algorithm;
基于贪心算法的科学卫星下行传输规划
3.
Design of greedy algorithm about interest arbitrage;
套利问题的贪心算法设计
补充资料：有贪心
【有贪心】
（术语）与贪相应及贪所系属之心也。不与贪相应之余善心及无覆心，名为离贪心。见俱舍论二十六。
（术语）与贪相应及贪所系属之心也。不与贪相应之余善心及无覆心，名为离贪心。见俱舍论二十六。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条