搜索资源列表
tanxin
- 这是一个贪心算法的c程序。贪心算法（也叫贪婪算法）不是某种特定的算法，而是一类抽象的算法，或者说只是一种思想，它的具体表现在，对解空间进行搜索时，不是机械地搜索，而是对局部进行择优选取，贪心算法的目的不是为了找到全部解，也当然找不出最优解，而只是找出一种可行解，这样就会得到惊人的高效性。因此，贪心算法也叫启发式搜索，这种启发就是所谓的“贪心策略”。-This is a greedy algorithm c procedures. Greedy algorithm (also known as t
RWXML8
- 分别用贪心算法和启发式算法对测试用例集进行了最小化。-the Greedy and Heuristic is used to minimized the test suite.
Minoux_greedy_algorithm
- Minoux’s greedy algorithm is a method of a heuristic solution for the network design with linear separable costs.
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
chafensuanfa
- 差分进化算法（DE）是一种用于优化问题的启发式算法。本质上说，它是一种基于实数编码的具有保优思想的贪婪遗传算法[1] 。同遗传算法一样，差分进化算法包含变异和交叉操作，但同时相较于遗传算法的选择操作，差分进化算法采用一对一的淘汰机制来更新种群。由于差分进化算法在连续域优化问题的优势已获得广泛应用，并引发进化算法研究领域的热潮。 差分进化算法由Storn 以及Price [2]提出，算法的原理采用对个体进行方向扰动，以达到对个体的函数值进行下降的目的，同其他进化算法一样，差分进化算法不利用函数的梯
1-s2.0-S1389128609002217-main
- A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks We consider the channel assignment problem in a multi-radio wireless mesh network that involves assigning channels to radio interfaces for achieving e
greedy
- 贪婪算法，用于优化调度，本算法为通用性算法 可以进行细微修改即可用于自己的编程使用-Greedy Algorithm (GA) is used for the uation of the same case presented for the Branch and Bound method in Section 5.2. Particular heuristic criteria are created to choose the new solution point for each
greedy_diff_sum_80000
- Greedy heuristic with the objective of finding the mininal difference between the sums of elementf of two arrays of numbers formed given 80000 random numbers between 100000 and 999999. It includes what I call the Gym Teacher algorithm that effic
Grasp
- A Greedy heuristic for jobshop scheduling improvement with the objective of minimizing the maximum completion time (makespan) of jobs
knapsack_stl.cpp.tar
- simpleknapsackc++-implementation in c,c++,use greedy heuristic
ProjectAI
- c++ AI project artificial intelligence path planning route best first a * star * greedy first uniform cost dijkstra s optimal search heuristic incomplete project not working fully
Romania_Trip
- 罗马利亚度假问题 一. 问题描述 分别用代价一致的宽度优先、有限制的深度优先（预设搜索层次）、贪婪算法和A*算法求解“罗马利亚度假问题”。即找到从初始地点 Arad到 目的地点 Bucharest 的一条路径。 要求： 分别用文件存储地图和启发函数表，用生成节点数比较几种算法在问题求解时的效率，并列表给出结果。-Romania holiday issue I. problem descr iption Respectively, consistent with the c
lvxing
- 旅行商问题是NP完全的组合优化问题。分析了邻域启发式算法的基本操作,提出 一种简单的启发式贪心法,仅利用城市间的距离信息求解旅行商问题-Traveling salesman problem is np-complete combinatorial optimization problem.The basic operation of neighborhood heuristic algorithm is analyzed and presented A simple heuristic
Project_15352073_Dengdian_v2
- 停船问题退火解决，启发式算法解决泊位分配问题，退火是比较简单的，这里介绍简单的退火贪心来求解(To solve the problem of annealing, a heuristic algorithm to solve the berth allocation problem, annealing is relatively simple, this simple greedy annealing to solve)