搜索资源列表
SelectNum
- vc实现的只能选数问题，优于贪婪选择算法-VC select number
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
tanxin
- 背包问题的贪婪算法，主要是通过性价比来决定物品的选择。-The greedy algorithm knapsack problem, mainly through cost-effective to determine the choice of items.
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
The-Horse-On-Board-And-PPT
- 自行解出的非网络上流行的贪婪算法，非递归算法，有ppt详解-Solve their own network of popular non-greedy algorithm, non-recursive algorithm, a ppt Detailed
backpack-prob-algo-using-in-C
- 不过下面程序中的背包函数采用了贪婪算法的另一种写法（背包函数是以前的代码，用来比较两种算法）-backpack problem algorithm using Greedy in C
GNmatlab
- GN算法matlab源程序，遗传算法，贪婪算法-GN algorithm matlab source code, genetic algorithms, greedy algorithms
OMP
- OMP贪婪算法-OMP greedy algorithm
kruskal
- 求加权连通图的最小生成树的算法。kruskal算法总共选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树。-kruskal algorithm
final_tanxin_c
- c编写程序 贪婪算法 解决0-1背包问题-0-1 tanlan SUANFA
xujilin_zuihong_maltab
- MALTAB 求解0-1背包问题 贪婪算法-0-1 bag maltab bainxie
akndzh
- 关于贪婪算法的MP、OMP的多快怕最基本的matlab仿真。-Greedy algorithm on the MP, OMP fast matlab simulation of the basic fear.
MD5
- 贪婪算法的程序以及源代码还有贪婪算法的介绍以及实例应用-Greedy algorithm source code program and also the greedy algorithm introduction and application examples
adaptivePSOt
- 上传了改进的PSO算法，利用自适应原来改造了原来基于贪婪原理的粒子群算法，可以避免粒子群算法过早收敛或者陷入局部值等问题。-Upload the improved PSO algorithm using adaptive originally transformed the original particle swarm algorithm based on the principle of greed, can avoid premature convergence of particle s
greddyalgorithm
- 压缩感知中的几种贪婪算法，初学者入门可以看看，可以帮助你理解算法的过程，有cosamp、gOMP、OMP、ROMP、SAMP、SP、STOMP。-Compressed Sensing in several greedy algorithm, beginners can see, can help you understand the process of algorithm，there have cosamp、gOMP、OMP、ROMP、SAMP、SP、STOMP。
Whi
- 该程序用贪心算法来求解二分覆盖问题, 采用贪婪准则-The program cover problem with greedy algorithm to binary, by means of the criterion of greed
67373
- 贪婪随机自适应搜索法(GRASP)，使用随机化的最小最小完成时间算法来产生问题的初始解,再通过变邻域下降算法来改进这个解。(Greedy random adaptive search method)
CS
- 压缩感知常见的几种重建算法，主要是贪婪算法一类(the resconstruction algotithm of compressed sensing)
贪心算法
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。(Greedy algorithm (also called greedy algorithm) means that when solving a problem, it always makes the best choice at present. That is to say, not considering the overall opt
BP
- 除匹配追踪类贪婪迭代算法之外，压缩感知重构算法另一大类就是凸优化算法或最优化逼近方法，这类方法通过将非凸问题转化为凸问题求解找到信号的逼近，其中最常用的方法就是基追踪(Basis Pursuit, BP)，该方法提出使用l1范数替代l0范数来解决最优化问题，以便使用线性规划方法来求解(In addition to match-tracking greedy iterative algorithms, another major category of compressed-perceptual