搜索资源列表
tanxin
- 这是一个贪心算法的c程序。贪心算法（也叫贪婪算法）不是某种特定的算法，而是一类抽象的算法，或者说只是一种思想，它的具体表现在，对解空间进行搜索时，不是机械地搜索，而是对局部进行择优选取，贪心算法的目的不是为了找到全部解，也当然找不出最优解，而只是找出一种可行解，这样就会得到惊人的高效性。因此，贪心算法也叫启发式搜索，这种启发就是所谓的“贪心策略”。-This is a greedy algorithm c procedures. Greedy algorithm (also known as t
robot_lesson
- 一个使用贪婪算法解决机器人收集硬币问题的小练习。-use a greedy algorithm to solve the problem robot coin collection of small practice.
changyong
- 动态规划分治算法概率算法模拟退火算法神经网络搜索算法贪婪算法网上matlab遗传算法组合算法Floyd算法-dynamic programming algorithm partition probability algorithm simulated annealing neural network algorithm for the greedy algorithm search online matl ab genetic algorithm combination algorithm Fl
icsiboost-0.3.tar
- Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the
GreedyEM
- greedy em 混和模型训练算法-greedy em hybrid model training algorithm
贪心法
- 用贪心法解决TSP问题.输入数据可求得所要的最值的结果.-greedy algorithm used to solve TSP. Input data can be obtained by the most value to the results.
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
Algorithm
- 对贪婪算法做了详细的讲解，具体到生动的例子和代码示例，希望对大家有所帮助-Greedy algorithm for a detailed explanation, specific to the vivid examples and code samples, we hope to help
huichang
- 对贪心算法的应用，会场安排问题，会场开始和结束的时间在输入文件输入，所需的至少会场个数在输出文件输出-Greedy algorithm for the application of the venue arrangements, the venue of the beginning and end of time in the input file input, the venue for at least the required number in the output file outpu
KnapsackProblemCLanguagesSourceCode)
- 背包问题（贪婪算法）c语言源代码。希望有帮助！-Knapsack problem (greedy algorithms) c language source code. Hope that helps!
TSP
- TSP with greedy algorithm
ACOKP1227
- 加入贪婪策略和遗传算法中的变异策略的混合蚁群算法-Join the greedy strategy and mutation strategy of ant colony algorithm
thegreedyalgorithmusinggeneticalgorithmssolveknaps
- 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
Greedy-Algorithms.ppt
- Greedy algorithms in Greek
greedy-PEGASIS
- 在无线传感网络中，PEGASIS虽然不是严格的簇类协议，却延用了簇的思想。本程序在Ns2中进行模拟，使用贪心算法建立一条基于地理位置的链，即：PEGASIS中的簇。-In WSNs, PEGASIS routing protocol follows the idea of clustring though it is not a strict hierachical protocol. This program utilizes the greedy algorithm to build a l
06-greedy
- Greedy algorithm descr iption with some examples-Greedy algorithm descr iption with some examples.............
the-greedy-algorithm
- 算法设计与分析（第4章 贪婪算法），主要介绍贪婪算法-Algorithm Design and Analysis (Chapter 4, the greedy algorithm), introduces a greedy algorithm
A-new-greedy-
- 详细介绍了贪心算法用来解决最大覆盖的优势和初步实现了它的应用-Details of the greedy algorithm is used to solve the maximum coverage of the advantages and the initial realization of its application
Greedy-algorithm
- 贪婪算法是一种对某些求最优解问题的更简单、更迅速的设计技术，对范围相当广泛的许多问题他能产生整体最优解或者是整体最优解的近似解-Greedy algorithm is an optimal solution for some problems simpler, more rapid design techniques for a wide range of many of the problems that he could produce an overall optimal solution
greedy
- 使用贪心算法解决旅行商问题，代码原创，算法清晰，可以运行。-Use greedy algorithm to solve the traveling salesman problem, the code is original, clear algorithm can be run.