搜索资源列表
tanxinfa
- 算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constra
XR_AI_Project2_v1
- 用人工智能方法编写的五子棋程序,使用了贪心算法等，运行速度很快，人工智能比较强大-using artificial intelligence methods to prepare the 331 procedures, the use of the greedy algorithm, running very fast, more powerful artificial intelligence
Huffman树
- 用加权二叉树，最小堆和贪心算法实现的Huffman树，对学算法和数据结构的朋友很有帮助-weighted binary tree, the smallest reactors and the greedy algorithm Huffman tree for school algorithm and data structure of helpful friends
哈夫曼编码,最优前缀码的贪心算法
- 哈夫曼编码,最优前缀码的贪心算法,平均码长最短,Huffman codes, optimal prefix code of the greedy algorithm, the shortest average code length
Greedy_Implicit-贪心算法_隐枚举法
- 贪心算法_隐枚举法（0 - 1 整数规划求解）,matlab代码-Greedy algorithm _ implicit enumeration method ( 0- 1 integer programming solver ) ,matlab code
huichanganpai.rar
- 贪心算法，会场安排问题！希望对大家有帮助，谢谢！,Greedy algorithm, the venue arrangements! We want to help, thank you!
LectureHalls.rar
- acm算法设计—会场安排问题！ 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。) 对于给定的k个待安排的活动，编程计算使用最少会场的时间表。,acm algorithm design- the venue arrangements! Assume it to be enough room
greedyalgorithm.rar
- 利用贪心算法从而实现了任务调度问题的过程,Greedy algorithm- the task scheduling problem
paike.rar
- 一个基于贪婪算法和分治算法以及回溯法的一个大型IT职业培训机构（湖北银河学院）的排课系统，采用AJAX+Mysql！！,A greedy algorithm based on the algorithm and sub-administration, as well as a large-scale retrospective law IT vocational training institutions (Institute of Hubei Galaxy) the Course Schedu
horse-riding-board
- 马踏棋盘程序，使用c++编写，经典的贪心算法实现快速得出结果-Horse riding board, the use of c++ written in the classic outcome of the greedy algorithm for fast
GreedySnakeTest
- 本代码主要借助OpenCV第三方库实现对目标轮廓提取，Greedy算法相对简单，好时量少，是一种不错的轮廓提取算法-This code mainly through third-party libraries to achieve the goals OpenCV contour extraction, Greedy algorithm is relatively simple, less good when it is a good contour extraction algorithm
suanfashiyanbaogao
- 算法设计实验报告 递归与分治 和贪心算法-Recursive algorithm design lab report and the greedy algorithm with sub-rule
Greed
- 利用贪心算法解决“部分背包问题”。这是个经典算法，实现的也比较完善，易用而且BUG少。-This code is about the "Knapsack problem".Our policy is the "Greedy Algorithm".It s easy to use & has nearly no BUG.
greedy_OBST
- 贪心算法实现的最优二叉查找树，c++代码实现，运行无误-Greedy algorithm of optimal binary search tree, c++ code to run correctly
huffman.rar
- 用优先队列实现霍夫曼编码，是对贪心算法实现的一个详细代码。输入文件是待编码文件，输出文件是各个字符编码信息。,Priority queue with the realization of Huffman code is a greedy algorithm to achieve a detailed code. Input file is to be encoded file, output file is all character encoding information.
TSP-MST.rar
- 最小生成树的思想应用于TSP问题的求解，贪心算法的实际应用。,Minimum Spanning Tree thinking applied to TSP problem solving, the practical application of greedy algorithm.
12-1
- 关于货箱装船问题的贪婪算法，只是简要描述-Container ship on the issue of greedy algorithm, only a brief descr iption of
work9
- 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场，设计一个有效的贪心算法进行安排。-Enough to assume that many of the arrangements for the venue where a number of activities and want to use the venue as small as possible, design an efficient greedy algorithm to carry out the arrangemen
GreedyBag
- 贪心算法求背包问题,分别求出了三种标准1. 按效益值由大到小取物品. 2. 按重量值由小到大取物品 3.按比值pi/wi的值由大到小取物品 其中第3种是最优解-Greedy algorithm for knapsack problem, respectively, obtained three standard 1. Press-effective value of descending and remove things. 2. By weight the value of items
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