搜索资源列表
xinchengxu
- 包括GRAY码，工作分配问题，会场安排，石子，行数字三角形，最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorithm. Using dynamic programming,
BTGame
- AStar2006 的3.变态比赛规则的一种算法.采用贪心算法,效率比较高.-AStar2006 the three. Competition rules perverts the algorithm. Greedy algorithm more efficient.
哈夫曼编码,最优前缀码的贪心算法
- 哈夫曼编码,最优前缀码的贪心算法,平均码长最短,Huffman codes, optimal prefix code of the greedy algorithm, the shortest average code length
GreedyBag
- 贪心算法求背包问题,分别求出了三种标准1. 按效益值由大到小取物品. 2. 按重量值由小到大取物品 3.按比值pi/wi的值由大到小取物品 其中第3种是最优解-Greedy algorithm for knapsack problem, respectively, obtained three standard 1. Press-effective value of descending and remove things. 2. By weight the value of items
StoneGame
- 编程习题石子游戏的代码，贪心法实现，c-Pebble game code, greedy method, c++
beibaowenti
- 背包的问题求解，用贪心和遗传算法界的，非常好用，大家下载哦-Knapsack problem-solving, with greedy and genetic algorithm community, very easy to use, we download oh. . .
OnlineAlgorithm
- 在线算法的实现：包括Blance算法、混合型算法及贪心算法-Online algorithms to achieve: Blance algorithm, hybrid algorithm and greedy algorithm
tanxin
- 王晓东《算法设计与分析》（第3版）贪心算法章节的源码 本人参考书中内容自己写的，绝对可以运行-Design and analysis of Wang Xiaodong " algorithm " (Third Edition ) Chapter I greedy algorithm source code reference book to write their own, absolutely can run
suanfa
- 算法程序与设计试验中的经典算法的源代码：像是分治递归，贪心，回溯等。-Algorithm design test of the classical algorithm source code: such as divide and conquer recursion, greedy, backtracking.
2013--GISS
- 快速稀疏重建： Greedy Inverse Scale Space Flows 贪婪的逆尺度空间算法 -Fast Sparse Reconstruction: Greedy Inverse Scale Space Flows
myAlgrithms
- 这是贪新算法以及优化的贪新算法实现，简单易懂方便使用，适合初学者学习了解。-This new algorithm is greedy and greedy algorithm optimized implementation of new, simple and easy to use and easy to understand for beginners to learn about.
The-greedy-algorithm
- 贪心算法，最小生成树实例方便初学者学习使用的。-Greedy algorithm, minimum spanning tree instance easy for beginners to learn to use.
Dijskstra
- 用贪婪算法和最小路径法解决TSP问题，用matlab实现-With the greedy algorithm to solve the TSP problem and minimal path method, using matlab realize
59b97a0f9cd260b6704714809da8ed39
- 旅行商问题是一个经典的问题，此代码用三种方法（枚举法，回溯法，贪心法），并可以对这三种方法进行比较-Traveling salesman problem is a classic problem, this code in three ways (enumeration method, backtracking, greedy method), and can be compared to the three methods
dct-lnormal
- DCT基广泛应用于图像去噪，信号分离。BP与OMP算法作为贪婪算法的代表用于信号恢复。-DCT is widely used in image denoising, signal separation. As a representative of the greedy algorithm of BP and OMP algorithm for signal recovery.