搜索资源列表
Dijkstra
- Dijkstra算法求最短路径(C#版) using System using System.Collections using System.Text namespace Greedy { class Marx { private int[] distance private int row private ArrayList ways = new ArrayList() public Marx(int n,params int
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
Prim
- 用贪心算法，求解最短路径问题； 通过根据当前的最优情况，选择最好的节点；-greedy alogith ,in order to get the best result for the station of the matter
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
Algoritma-penjadwalan-disk(anggi)
- this is about greedy disk sceduling,and its so helpfull to understanding a greedy algoritm
SUANFAPPT
- 常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) -Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm
seg-ijcv
- This paper addresses the problem of segmenting an image into regions. We de¯ ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an e±cient segmentation
greedy-snake
- vs用c#语言编写的贪吃蛇小程序，可以拿来学习c#-vs c# language with Snake small program that can be used to learn c#
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
Greedy-algorithm
- 贪心算法解决木棒覆盖最多点的问题，食用一定量定长的木棒，使其覆盖尽可能多的点。-Solve the problem of sticks to cover some greedy algorithm
greedy
- 贪婪算法，可以实现最优的资源分配策略，给小白们作为参考-Greedy algorithm, you can achieve the optimal allocation of resources strategy, to white people as a reference