搜索资源列表
贪婪算法作业
- 一个关于使用贪婪算法的程序,是我同学在外国上课的一个作业,对学校贪婪算法有一定的帮助,详细的题目和注释在里面-a greedy algorithm on the use of the procedure is that I students in a class of foreign operations, the greedy algorithm schools will help, and the subject of detail
背包问题之贪婪算法求解C语言源代码
- 其实原来的程序也是采用了贪婪算法,不过下面程序中的beibao1函数采用了贪婪算法的另一种写法,beibao函数是以前的代码,用来比较两种算法-fact, the original procedure is used in the greedy algorithm, but the procedures below beibao1 function of the greedy algorithm used another way, be
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题,这是我编的一个小程序,运行过很好。-greedy algorithm can be used to solve a very good 0 / 1 knapsack problem, this is my part of a small program running very good.
背包问题之贪婪算法求解C语言源代码)
- 背包问题的贪婪算法,需要的下,不需要帐号的,自由的下。-knapsack problem of greedy algorithm, need, need not account, free under.
贪婪算法-单源最短路径
- 贪婪算法最短路径实现。单源最短路径-greed to achieve the shortest path algorithm. Single-source shortest path. .
贪婪法解最短回路问题
- 一个用变形贪婪法解货郎回路的C程序代码 思想 1.选择一条最短的边作为部分解。 2.选择一条最短的且将之加入到部分解不形成回路的边。 3.重复第2步,直至所有的结点都包含在部分解中。-deformation with a greedy method for the Traveling Salesman circuit C code ideological one. Choose a minimum as part of the solu
signal recovery from partial information via orthogonal matching pursuit(贪婪算法OMP).
- signal recovery from partial information via orthogonal matching pursuit(贪婪算法OMP).
greedy for ofdm
- 在ofdm中采用贪婪算法来进行功率分配,相信很多人在寻找类似的算法,贡献处女代码哈哈
greedy
- 使用贪婪算法 解决0-1背包问题MATLAB源代码-greedy algorithm used to solve 0-1 knapsack problem MATLAB source code
abcd
- 贪婪算法解决背包问题-greedy algorithm to solve knapsack problem
Class1
- 用贪婪算法中的哈夫曼编码为文件进行压缩,得到一个比较好的压缩程序.-greedy algorithm with the Huffman encoding of the document for compression, to be a relatively good compression process.
贪婪法解最短回路问题
- 一个用变形贪婪法解货郎回路的C程序代码 思想 1.选择一条最短的边作为部分解。 2.选择一条最短的且将之加入到部分解不形成回路的边。 3.重复第2步,直至所有的结点都包含在部分解中。-deformation with a greedy method for the Traveling Salesman circuit C code ideological one. Choose a minimum as part of the solu
贪婪算法作业
- 一个关于使用贪婪算法的程序,是我同学在外国上课的一个作业,对学校贪婪算法有一定的帮助,详细的题目和注释在里面-a greedy algorithm on the use of the procedure is that I students in a class of foreign operations, the greedy algorithm schools will help, and the subject of detail
背包问题之贪婪算法求解C语言源代码
- 其实原来的程序也是采用了贪婪算法,不过下面程序中的beibao1函数采用了贪婪算法的另一种写法,beibao函数是以前的代码,用来比较两种算法-fact, the original procedure is used in the greedy algorithm, but the procedures below beibao1 function of the greedy algorithm used another way, be
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题,这是我编的一个小程序,运行过很好。-greedy algorithm can be used to solve a very good 0/1 knapsack problem, this is my part of a small program running very good.
背包问题之贪婪算法求解C语言源代码)
- 背包问题的贪婪算法,需要的下,不需要帐号的,自由的下。-knapsack problem of greedy algorithm, need, need not account, free under.
贪婪算法-单源最短路径
- 贪婪算法最短路径实现。单源最短路径-greed to achieve the shortest path algorithm. Single-source shortest path. .
贪婪算法
- 用某种方法选择n-1条边使它们形成G的最小生成树。至少可以采用三种不同的贪婪策略来选择这n-1条边。(Choose n-1 edges in some way so that they form the minimum spanning tree of G. At least three different greedy strategies can be used to select this n-1 edge.)
贪婪算法
- 贪婪算法在数学建模中的应用,可用于最优化的方案(The application of greedy algorithm in mathematical modeling, which can be used for optimization)
贪婪算法仿真
- 基于matlab平台使用贪婪算法最终实现多智能体覆盖问题(Multi agent coverage problem using greedy algorithm)