搜索资源列表
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
yuhen
- 用贪心算法解题: 设n是一个正整数。现在要求将n分解为若干互不相同的自然数的和，且使这些自然数 的乘积最大。-Greedy algorithm with problem-solving: Let n be a positive integer. N decomposition will now require a number of separate and natural number, and make them the product of the largest natural nu
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
BCS
- 压缩传感是一个从2006年左右开始兴起的研究领域，它关注于如何采样信号，也就是信号的采样方式或者压缩方式。通过设计一种特殊的采样方案，可以使得采样频率降低为信号的“信息率”，而不是传统的奈奎斯特采样率，于是，实际的采样率可以大大低于奈奎斯特频率，却只损失很少的信息量，依然保持了充足的信息量足以恢复出采样前的原始信号。这个研究思想挑战了奈奎斯特频率的理论极限，会对整个信号处理领域产生极其深远的影响，同时，信号处理的许多应用领域也会随之发生根本性的发展和变化。 -Compressive sens
Prim
- 用贪心算法，求解最短路径问题； 通过根据当前的最优情况，选择最好的节点；-greedy alogith ,in order to get the best result for the station of the matter
m4-heuristics
- Best-first search Greedy best-first search A* search Heuristics Local search algorithms Hill-climbing search Simulated annealing search Local beam search Genetic algorithms
ders4_2007
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
ders5_2007
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
ders6_2007
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
ders7_2006
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
ders8_2006
- Develop two different implementations of Snake model by using a Greedy algorthm and an Gradient Descent method. Compare results. Put all details and results in your report.
lysnake
- 提出了一种自适应的Snake 算法,对于初始包络上的每一点,按照Greedy 算法中的能量公式计算其邻域内各点的能 量. 如果邻域不包含目标的轮廓,则将邻域半径加大,再次计算邻域内各点的能量,直到邻域内包含轮廓点为止. 该算法只需迭 代一次即可得到目标轮廓,而且增大了初始包络的收敛半径,并能够有效处理较高曲率凸形边缘的情况. 对比实验说明了这种 方法的有效性.-Snake proposed an adaptive algorithm, the initial envelope for
GreedyAlgOfdmExample
- Greedy Alg Ofdm Example
Hybrid-Greedy-multicasting-Power-aware-Routing-Pr
- Hybrid Greedy multicasting Power-aware Routing Protocol in Ad Hoc Networks
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