搜索资源列表
tanxin
- 这是一个贪心算法的c程序。贪心算法（也叫贪婪算法）不是某种特定的算法，而是一类抽象的算法，或者说只是一种思想，它的具体表现在，对解空间进行搜索时，不是机械地搜索，而是对局部进行择优选取，贪心算法的目的不是为了找到全部解，也当然找不出最优解，而只是找出一种可行解，这样就会得到惊人的高效性。因此，贪心算法也叫启发式搜索，这种启发就是所谓的“贪心策略”。-This is a greedy algorithm c procedures. Greedy algorithm (also known as t
SuanFa
- 各种数值算法，包括：二叉树、贪心算法、搜索算法、遗传算法、模拟退火算法、分治策略等等。
Activity_Selection
- 贪心算法实现活动选择问题——最短路径，想学习贪心算法的可以参考
tanxi
- 贪心算法解决送货员问题，使其走过的路线尽量减少，近似解求得NP问题的解。
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
37724088tanxi
- 贪心算法-Greedy algorithm
TSptanxin
- TSP贪心算法C++ ,很有用的源代码哦-based genetic algorithm for multi- objective optimization. It is a very e® ective algorithm but has been generally criticized for its computational complexit
GreedyTSP
- 贪心算法的TSP 求解 10000城市 数据文件可以自己建立 C代码编程-Greedy algorithm for solving TSP 10000 to establish their own city data files can be C code programming
rsa_design_development_algorithm
- rsa classic design development documents greedy algorithm rsa贪心算法设计经典开发文档-rsa classic design development documents greedy algorithm
thegreedyalgorithmusinggeneticalgorithmssolveknaps
- 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
tsp
- 简单的贪心算法解决tsp问题。输入的时候麻烦点，读者可以加以修改，使程序完善。-Tsp simple greedy algorithm to solve the problem. When the input trouble spots, readers can be modified to process improvement.
ANT-TX
- 用蚁群算法和贪心算法解决0/1背包问题。可用于不同算法的比较。-Solving 0/1 Knapsack Problem by ant colony algorithm and greed method.Can be used to compare two algorithms.
multiple-gateways
- 目前，物联网备受关注。在多网关无线传感网络与物联网的异构融合中，通过网关连接是最常用的策略。本程序基于贪心算法，寻找每个节点至多个网关的最优路径，并将流量按比例分配给各网关。- Recently, the Internet of Things is getting more and more attention.There are different approaches to integrate WSN into the Internet. The most usual one is to
single-gateway
- 在无线传感网络与物联网的异构融合中，通过单个网关连接是最常用的策略。本程序利用智能贪心算法寻找每个节点至网关的最短路径。-There are different approaches to integrate WSN into the Internet. The most usual one is to connect the WSN and the Internet through a gateway. This program makes uses of the greedy algorit
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
TSP
- 用贪心算法实现tsp(旅行商问题)求解，实现中国34个城市环游路线-With the greedy algorithm tsp (TSP) solution to achieve China' s 34 cities around the line
beibaoproblem
- 该算法主要是用贪心算法求解背包问题。背包问题应用TSP问题也非常广泛-The algorithm is the greedy algorithm for knapsack problem.
TSP
- 用遗传算法、贪心算法以及穷举法对TSP问题进行求解-Genetic algorithm, the greedy algorithm and the brute-force method to solve the TSP problem
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
GoBang
- 采用c#编程的人机对战的五子棋程序，AI智能采用贪心算法和极大极小值算法，程序有详尽的注释，适合参考-Man-machine war backgammon program using c# programming, AI smart greedy algorithm and minimax algorithm, the program detailed notes for reference