Location:
Search - greedy strategy
Search list
Description: 这是一个贪心算法的c程序。贪心算法（也叫贪婪算法）不是某种特定的算法，而是一类抽象的算法，或者说只是一种思想，它的具体表现在，对解空间进行搜索时，不是机械地搜索，而是对局部进行择优选取，贪心算法的目的不是为了找到全部解，也当然找不出最优解，而只是找出一种可行解，这样就会得到惊人的高效性。因此，贪心算法也叫启发式搜索，这种启发就是所谓的“贪心策略”。-This is a greedy algorithm c procedures. Greedy algorithm (also known as the greedy algorithm) is not a specific algorithm, but a kind of abstract algorithm, or just a thought, it is specifically manifested in the solution space search, the search is not mechanical, but the partial merit selection, greedy algorithm not for the purpose of to find all the solutions are, of course, unable to find the optimal solution, but only to find out a feasible solution, and this can be alarming efficiency. Therefore, the greedy algorithm is called heuristic search, which inspired the so-called "greedy strategy."
Platform: |
Size: 1170 |
Author: 王卫红 |
Hits:
Description: 同学做的基于贪婪策略的拓扑排序算法可视化演示程序，支持用户自己画出拓扑图，VC++.net下测试通过。-students so greedy strategy based on the topological sorting algorithm visualization demo program that allows users to draw their own topology map, VC. Net under test.
Platform: |
Size: 68808 |
Author: 杨智丹 |
Hits:
Description: 多机调度问题要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。 这个问题是NP安全问题，到目前为止还没有有效的解法。对于这一类问题，用贪心选择策略有时可以设计出较好的近似算法。-machine scheduling problems required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing completed. The problem is NP security issues, so far no effective solution. For this type of issue, greedy strategy can sometimes choose to design a better approximation algorithm.
Platform: |
Size: 1515 |
Author: 姚翊 |
Hits:
Description: 多机调度问题要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。 这个问题是NP安全问题，到目前为止还没有有效的解法。对于这一类问题，用贪心选择策略有时可以设计出较好的近似算法。-machine scheduling problems required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing completed. The problem is NP security issues, so far no effective solution. For this type of issue, greedy strategy can sometimes choose to design a better approximation algorithm.
Platform: |
Size: 1024 |
Author: 姚翊 |
Hits:
Description: 这是一个贪心算法的c程序。贪心算法（也叫贪婪算法）不是某种特定的算法，而是一类抽象的算法，或者说只是一种思想，它的具体表现在，对解空间进行搜索时，不是机械地搜索，而是对局部进行择优选取，贪心算法的目的不是为了找到全部解，也当然找不出最优解，而只是找出一种可行解，这样就会得到惊人的高效性。因此，贪心算法也叫启发式搜索，这种启发就是所谓的“贪心策略”。-This is a greedy algorithm c procedures. Greedy algorithm (also known as the greedy algorithm) is not a specific algorithm, but a kind of abstract algorithm, or just a thought, it is specifically manifested in the solution space search, the search is not mechanical, but the partial merit selection, greedy algorithm not for the purpose of to find all the solutions are, of course, unable to find the optimal solution, but only to find out a feasible solution, and this can be alarming efficiency. Therefore, the greedy algorithm is called heuristic search, which inspired the so-called "greedy strategy."
Platform: |
Size: 1024 |
Author: 王卫红 |
Hits:
Description: 同学做的基于贪婪策略的拓扑排序算法可视化演示程序，支持用户自己画出拓扑图，VC++.net下测试通过。-students so greedy strategy based on the topological sorting algorithm visualization demo program that allows users to draw their own topology map, VC. Net under test.
Platform: |
Size: 68608 |
Author: 杨智丹 |
Hits:
Description: 用Ｃ++语言实现的关于已知长和宽的矩形，以及众多半径不同的圆形，运用贪心策略摆放尽量多的圆形在矩形中-With C++ Language on the known length and width of the rectangle, as well as many different circular radius using the greedy strategy of placing as many as possible in the rectangle in a circular
Platform: |
Size: 1024 |
Author: sjj |
Hits:
Description: 一种基于非贪婪策略的网络蜘蛛搜索,适用于人工智能中搜索的架构和研究的文章！-A greedy strategy based on non-network spider search, apply artificial intelligence to search for and study the structure of the article!
Platform: |
Size: 99328 |
Author: liu |
Hits:
Description: 第1章 算法引论
第2章 递归与分治策略
第3章 动态规划
第4章 贪心算法
第5章 回溯法
第6章 分支限界法
-Chapter 1 Introduction Algorithm Chapter 2 Recursion and sub-rule strategy in Chapter 3 Dynamic Programming Chapter 4 greedy algorithm in Chapter 5 Backtracking Chapter 6 branch and bound method
Platform: |
Size: 3323904 |
Author: jake |
Hits:
Description: 01背包问题，计算机算法中使用贪心算法与贪心策略的实现-01 knapsack problem, the computer algorithm with the greedy algorithm using the greedy strategy to achieve
Platform: |
Size: 263168 |
Author: zym |
Hits:
Description: 基于贪心策略的五子棋人机对弈，简单的人机对弈，可以应付一下初级选手，算法还有很大改进空间，有兴趣的可以研究一下，有改进的话记得发我一份，一起研究-Gobang greedy strategy based on human-computer game, a simple man-machine game, players can cope with the initial look, there is still much room for improvement algorithm, interested can look for improvement, then remember that I made in a study with
Platform: |
Size: 54272 |
Author: 刘建林 |
Hits:
Description: 0／1背包问题的贪心优化解法 邓宏涛朱蜘
(江汉大学数学与计算机学院武汉430056)
摘要：介绍了0／1背包问题的基本贪心算法的解决策略，通过对贪心算法的改进和优化，找出0／1背包问题的最优解
的很好近似。-0/1 knapsack problem greedy optimization method of邓宏涛Zhu spider (Jianghan University, Mathematics and Computer Science, Wuhan 430056) Abstract: 0/1 knapsack problem of the greedy algorithm to solve the basic strategy of the greedy algorithm through the improvement and optimization, to find 0/1 knapsack problem of the optimal solution of a very good approximation.
Platform: |
Size: 175104 |
Author: qqq |
Hits:
Description: 算法难，递归易，算法皆以递归源，相同处理自循环；
递归处理分和并，分而治之是首选。
DP全，贪心简，最优性质二者兼；
DP需要表来填，子问题解表中见；
贪心策略需证明，整体可由局部建。
回溯深，分限广，剪枝函数两边忙；
一边剪左不可行，一边剪右非最优。
分限还需优先级，上界下界来排序；
叶子放在队列里，轮到它时达目的。-Algorithm is difficult, recursive easy recursive algorithm begin with the source, the same treatment from the cycle recursive processing points, and, of divide and rule is preferred. DP Quan, greed Jane, the optimal nature of the two chief DP need to fill in the table, sub-problem solution in the table, see greedy strategy will need to prove that the whole can be built locally. Back deep, sub-limit of a wide pruning function on both sides of busy the left side of the cut is not feasible, cut the right side of the non-optimal. Sub-limit needed priority, the upper bound lower bound to sort leaves placed in the queue, the turn when it attain this purpose.
Platform: |
Size: 648192 |
Author: Ren |
Hits:
Description: 实现背包问题的三种贪心策略，背包问题描述如下: 已知
背包容量M=120
物品种类数n=10
各种物品的总效益pi(i=1,2,………10) : 50,60,70,80,90,80,70,60,50,40
各种物品的总重量wi(i=1,2………10) : 17,30,25,41,80,70,64,56,47,38
求: 各种物品所取重量占其总重量的比例xi(i=1,2,…..10),满足0<=xi<=1,
且
且使得
达到最大值.
-Knapsack problem to achieve the three greedy strategy, knapsack problem described as follows: It is known knapsack capacity M = 120 the number of n = 10 categories of items of various items of the total benefits pi (i = 1,2, ... ... ... 10): 50,60 , 70,80,90,80,70,60,50,40 total weight of all kinds of items wi (i = 1,2 ... ... ... 10): 17,30,25,41,80,70,64,56 , 47,38 seeking: all kinds of items by taking the ratio of the weight of its total weight of xi (i = 1,2, ... .. 10), satisfy 0 < = xi < = 1, and and making the maximum.
Platform: |
Size: 864256 |
Author: lixiang |
Hits:
Description: 加入贪婪策略和遗传算法中的变异策略的混合蚁群算法-Join the greedy strategy and mutation strategy of ant colony algorithm
Platform: |
Size: 2048 |
Author: xuqiang |
Hits:
Description: C语言写的贪心策略解背包问题 谈恋策略为价、重比 不是最优解-C language to write about knapsack problem greedy strategy solution for the price of love strategy, not the optimal solution weight ratio
Platform: |
Size: 1024 |
Author: zry |
Hits:
Description: C语言写的贪心策略解背包问题 谈恋策略为价、重比 不是最优解-C language to write about knapsack problem greedy strategy solution for the price of love strategy, not the optimal solution weight ratio
Platform: |
Size: 2048 |
Author: zry |
Hits:
Description: 特殊的0-1背包问题求解，使用贪心法求解，有多个贪心策略。-0-1 Knapsack Problem particular, the use of greedy method, a number of greedy strategy.
Platform: |
Size: 2374656 |
Author: aiken |
Hits:
Description: 利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi，它的总价值为Pi，假定M、Wi、Pi均为整数。设计程序给出装货方法，使装入背包的货物总价值达到最大。-Greedy strategy to solve the knapsack problem using. Current load of M kg backpack and n kinds of goods. First i kind of cargo weight Wi, its total value of Pi, assuming M, Wi, Pi are integers. Given method of loading the design process, so that the total value of goods into the bag maximum.
Platform: |
Size: 1024 |
Author: 00 |
Hits:
Description: 多会场活动安排算法实现。利用嵌套贪心策略实现多会场、互斥活动最优安排问题。-Arrangements for multi-venue event algorithm. Greedy strategy using nested multi-venue, the best arrangement for mutually exclusive events.
Platform: |
Size: 161792 |
Author: 黄诚 |
Hits: