搜索资源列表
贪心算法实现多处理机调度
- 该程序是有关于利用贪心算法实现多处理机调度，可以在vc++上直接运行，只有源代码
贪心法求任务调度问题
- 西电算法课的贪心部分上机试验题目！
tanxinfa.rar
- 北京大学研究生课程“算法分析与计算复杂性理论”的课件，讲的是贪心算法。,University post-graduate courses
greed
- 带有期限和效益的单位时间的作业排序贪心算法。作业已按效益值递减的顺序排好，依次输入各作业的期限值，要求按顺序输出最优解。-With the duration and effectiveness of the unit time Scheduling greedy algorithm. Operating efficiency values have been decreasing order, the order input period value of the o
algorithmic
- 是一个介绍常用算法的课件，如贪心算法，规划算法等，试一下吧-Is a commonly used method to introduce the courseware, such as the greedy algorithm, planning algorithms and so on, try it
4-7you
- 计算机算法的多处最优服务次序问题，用贪心算法实现-Computer algorithm of multiple optimal service order issues, with greedy algorithm
tanxinsuanfa
- 本文章介绍了贪心算法的过程及运用C语言的实现-This article describes the process of greedy algorithm and the realization of the use of C language
suanfashejiyufenxi
- 计算机算法设计与分析实验报告:6大算法详细实验报告(相当详细).分治,动态规划,贪心,回溯,分支限界-Computer Algorithm Design and Analysis of Experimental Report: 6 large algorithm experiment detailed report (in considerable detail). Sub-rule, dynamic programming, greedy, backtracking, branch and b
zuixiaoshengchengshu
- 使用贪心算法编程，求解最小生成树问题,并给出详细的过程！-The use of greedy algorithm programming, minimum spanning tree problem solving, and gives details of the process!
define_the_latter_table.txt
- 根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current si
Algorithm
- 算法分析与设计的讲义 内容有动态规划，分制思想，贪心算法等-Algorithm analysis and design of the lecture content of dynamic programming, sub-system thinking, greedy algorithm
01pack
- 用动态规划，贪心算法等算法实现01背包问题-Using dynamic programming, greedy algorithm knapsack problem algorithm 01
sffx
- 算法分析实验 包含背包算法，硬币问题，贪心算法-Algorithm analysis experiments including knapsack algorithm, coins, greedy algorithm
park
- 是公园路径搜索的c++实现方法，功能比较简单，是课程设计的。用到了迪杰斯特拉算法和贪心算法求最短路径-Is a park path search c++ implementation method is relatively simple functions, curriculum design. Use the Dijkstra algorithm and the greedy algorithm for the shortest path
qichejiayou
- 一辆汽车加满油后可行驶n公里，旅途中有若干个加油站，设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少，对于给定的n和k个加油站位置，编程计算最少加油次数。 可以利用贪心选择性质来求解汽车加油问题，也就是所求问题的整体最优解可以通过一系列局部最优的选择，即贪心选择来达到。这是贪心选择算法可行的第一个基本要素，也是贪心算法与动态规划算法的主要区别。在动态规划算法中，每步所做的选择往往信赖于相关子问题的解，因而只有在解出相关子问题后，才能做出选择。而在贪心算法中仅在当前状态下做出最
greedyalgorithm
- 贪心算法是一种更为高效的算法，程序已全部通过-greedy algorithm
suanfafenxi
- 算法分析课的实验-算法分析与设计\贪心算法-最优装载
贪心算法
- 贪心算法的详细说明，哈哈哈哈哈哈哈哈哈哈哈(Greedy algorithm is described in detail)
贪心
- 贪心算法的应用：对地点运输的贪心算法实现(Application of greedy algorithm)
源代码及数据
- 随着高校不断扩招，数字化校园的不断推进，应用信息化高效的分配和管理宿舍是非常有意义的。本作品创新性地引入了“种子选手”，并基于贪心算法设计出宿舍分配方案。用Python的GUI设计可视化界面，最终形成了宿舍分配系统。(With the continuous expansion of colleges and universities and the continuous promotion of digital campus, it is very meaningful to distribut