搜索资源列表
suanfashiyanbaogao
- 算法设计实验报告 递归与分治 和贪心算法-Recursive algorithm design lab report and the greedy algorithm with sub-rule
TSPproblems
- 解决TSP问题的几种算法 模拟退火法 遗传算法 贪心算法等-To solve the problem of several TSP algorithm simulated annealing greedy algorithm such as genetic algorithms
B01AB525d01
- The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this paper, we address the problem of generalizing LC tries and Extensible H
lysnake
- 提出了一种自适应的Snake 算法,对于初始包络上的每一点,按照Greedy 算法中的能量公式计算其邻域内各点的能 量. 如果邻域不包含目标的轮廓,则将邻域半径加大,再次计算邻域内各点的能量,直到邻域内包含轮廓点为止. 该算法只需迭 代一次即可得到目标轮廓,而且增大了初始包络的收敛半径,并能够有效处理较高曲率凸形边缘的情况. 对比实验说明了这种 方法的有效性.-Snake proposed an adaptive algorithm, the initial envelope for
coloring
- Coloring algorithm with greedy method in C-Coloring algorithm with greedy method in C++
kruskal
- implementation Kruskal algorithm with greedy method in C-implementation Kruskal algorithm with greedy method in C++
non_itera_greedy_alog
- A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
greedy
- A fast algorithm for active contours and curvature estimation
aaa
- 很好的算法，贪婪算法，很实用，能解决很多问题，大家快来看啊。-Good algorithm, greedy algorithm, very practical, can solve many problems, we Come ah.
sgrasp
- This paper is a survey of greedy randomized adaptive search procedures (GRASP). GRASP is a multi-start or iterative procedure where each GRASP iteration con- sists of a construction phase, where a feasible solution is constructed, followed by a l
algorithm1
- 动态规划可以找到最优子结构特征，贪心算法用于求解最优化问题-Dynamic programming can be found in sub-optimal structural characteristics greedy algorithm for solving optimization problems
Greedy-algorithm-courseware
- 贪婪算法的课件，对于学习数据结构的孩子很有帮助哦-Greedy algorithm courseware, data structures for children to learn helpful Oh
package
- 改代码实现的是用贪心算法解决0—1背包问题，用c++实现。-Change the code is to solve 0-1 knapsack problem with the greedy algorithm, using c++ implementation.
algorithm
- 以设计策略为主线，循序渐进地介绍了经典算法设计（包括分治、动态规划、贪心、回溯、迭代改进等算法）、NF完全理论、非精确型算法设计〔包括近似算法、参数化算法，随机算法），以及现代智能优化方法．强调算法思维与编程实践并重，注重运用算法技术解决实际工程问题。-In order to design strategy as the main line, gradual introduction of the classic algorithm design (including the partition
Greedy-algorithm
- 贪心算法解决木棒覆盖最多点的问题，食用一定量定长的木棒，使其覆盖尽可能多的点。-Solve the problem of sticks to cover some greedy algorithm
Subspace-Methods-for-Joint
- 基于子空间方法的联合稀疏恢复，通过MUSIC算法进行结合测试，给出了测试结果-We propose subspace-augmented MUSIC (SA-MUSIC), which improves on MUSIC such that the support is reliably recovered under such unfavorable conditions. Combined with a subspace-based greedy algorithm, known
Traveling-Salesman-Problem---Nearest-Neighbor
- Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algor
greedy
- 贪婪算法，可以实现最优的资源分配策略，给小白们作为参考-Greedy algorithm, you can achieve the optimal allocation of resources strategy, to white people as a reference
first
- 贪心算法，哈夫曼编码 ，最优编码二叉树。(Greedy algorithm, Huffman coding, optimal coding two trees.)
graph_coloring
- 基于matlab的图着色程序，算法为贪心算法，将节点按照度从大到小排序，排序后先给度大的着色。(The graph coloring program based on MATLAB algorithm, greedy algorithm, the node according to the degree from large to small order, ranking after the first to a large degree of coloring.)