Location:
Search - greedy
Search list
Description: 迭代蛇模型，包含GUI界面 可以绘制每次点的变化 也可以直接得到结果-Greedy Algorithms
Active contour
Platform: |
Size: 264192 |
Author: 大仙 |
Hits:
Description: Greedy Program for reconstuction convex binary matrix
Platform: |
Size: 2048 |
Author: Mohamed |
Hits:
Description: 贪婪算法的课件，对于学习数据结构的孩子很有帮助哦-Greedy algorithm courseware, data structures for children to learn helpful Oh
Platform: |
Size: 301056 |
Author: 李婉真 |
Hits:
Description: 使用C语言编写的背包问题之贪婪算法求解源代码 -Greedy algorithm using C language source code for solving the knapsack problem
Platform: |
Size: 1024 |
Author: 刘锋 |
Hits:
Description: Greedy sanke algorithm implements-贪婪蛇算法的实现，该算法是对原Donna J. Williams 《A fast algorithm for active contours》 （1990） 论文的简化实现。对算法研究很有帮助。参数很多，需要调节才能获得良好的效果。
Platform: |
Size: 168960 |
Author: weng |
Hits:
Description: 马踏棋盘贪心算法的主要实现方式的源代码,为新手学习贪心算法提供便利-Horse riding board the main way to achieve the greedy algorithm source code, for beginners learning to facilitate the greedy algorithm
Platform: |
Size: 1024 |
Author: 王臣亮 |
Hits:
Description: greedy search for signal processing
Platform: |
Size: 2048 |
Author: www |
Hits:
Description: 属于贪婪算法中正交匹配追踪算法，用于信道估计预编码中，利用稀疏性，减小信道估计和反馈的开销，此算法的输出为所需要的系数矩阵，压缩包中还有一些说明-Belonging greedy algorithm orthogonal matching pursuit algorithm, used for channel estimation pre-encoding, the use of sparsity, channel estimation and feedback to reduce the overhead, the output of this algorithm is required for the coefficient matrix, the compressed package and some instructions
Platform: |
Size: 362496 |
Author: xin |
Hits:
Description: 贪心算法，最小生成树实例方便初学者学习使用的。-Greedy algorithm, minimum spanning tree instance easy for beginners to learn to use.
Platform: |
Size: 1024 |
Author: su |
Hits:
Description: 贪心算法，喷水装置是一个练习贪心算法很好的实例-Greedy algorithm- water home equipment
Platform: |
Size: 1024 |
Author: jade |
Hits:
Description: 贪婪算法，用于优化调度，本算法为通用性算法 可以进行细微修改即可用于自己的编程使用-Greedy Algorithm (GA) is used for the uation of the same case presented for the
Branch and Bound method in Section 5.2. Particular heuristic criteria are created to
choose the new solution point for each step of the algorithm.
Platform: |
Size: 3072 |
Author: kiwi |
Hits:
Description: 这是贪吃蛇的源代码，亲测，希望大家能够喜欢-greedy snake
Platform: |
Size: 717824 |
Author: 张硕 |
Hits:
Description: 贪心算法，基于C++程序的经典会议安排的算法的实现-greedy algorithm
Platform: |
Size: 1024 |
Author: 王先生 |
Hits:
Description: 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。-Greedy algorithm (also known as the greedy algorithm) refers to when to problem solving, always made in the current opinion is the best choice. That is to say, not to be considered the best on the whole, he was made in the local sense of the optimal solution.
Platform: |
Size: 33792 |
Author: 沈甲甲 |
Hits:
Description: 1）编程实现背包问题贪心算法和最小生成树prim算法。通过具体算法理解如何通过局部最优实现全局最优，并验证算法的时间复杂性。
2）输入5个的图的邻接矩阵，程序加入统计prim算法访问图的节点数和边数的语句。
3） 将统计数与复杂性函数所计算的比较次数比较，用表格列出比较结果，给出文字分析。
4）背包问题的实验数据如下表：n=8,m=110
-1) programming to implement the knapsack problem greedy algorithm and minimum spanning tree prim algorithm. Through the concrete algorithm, it is understood how to achieve the global optimization through local optimization, and the time complexity of the algorithm is verified.
2) enter the adjacency matrix of the 5 graphs, add the number of nodes and the number of edges in the prim algorithm.
3) comparison of the number of statistics and the calculation of the complexity function, the comparison results are listed in the table.
4) the experimental data of knapsack problem are as follows: m=110, n=8
Platform: |
Size: 12288 |
Author: 陈倩 |
Hits:
Description: 本文件夹是贪心算法的一种延伸，即最优路径，与以往的孙发不同之处在于添加了限制路径，是贪心算法的提高。其中还有知道PPT。-This folder is an extension of the greedy algorithm, namely the optimal path, different the past, Sun made that added restrictions path, is to improve the greedy algorithm. Which also know PPT.
Platform: |
Size: 1220608 |
Author: 刘钊 |
Hits:
Description: 把数组中的n个双字型元素按从大到小的顺序排列。增加一个交换标志，在排序完成时不再执行多余的外层循环-you greedy
Platform: |
Size: 1024 |
Author: zhibo |
Hits:
Description: 克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为简单理解的一个。这里面充分体现了贪心算法的精髓。-Kruskal algorithm (Kruskal' s algorithm) is relatively simple to understand one of two classic minimum spanning tree algorithm. Inside this fully reflects the essence of greedy algorithm.
Platform: |
Size: 153600 |
Author: 孙铭啸 |
Hits:
Description: 贪心算法法，算最优活动安排，主要体现贪心算法思想。-The greedy method, the optimal arrangements
Platform: |
Size: 1024 |
Author: mzi814159 |
Hits:
Description: gpsr greedy perimeter stateless rooting protocol
Platform: |
Size: 182272 |
Author: sam |
Hits:
«
1
2
...
4
5
6
7
8
910
11
12
13
14
...
50
»