搜索资源列表
greedyl
- 数据结构与算法，贪心法求最小生成树的c语言描述算法-Data structure and algorithm, greedy method for minimum spanning tree algorithm described in the c language
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
suanfaqxf
- 算法实验报告+源代码 实验一 1题 归并排序.cpp 11 实验一 2题 快速排序.cpp 12 实验二1题 贪心法求背包问题.cpp 13 实验二2题 贪心法求最短路径.cpp 16 实验三 动态规划求最短路径.cpp 17 实验四 回溯法求背包.cpp 18-Algorithm+ source code for test lab reports a problem for a merge sort. Cpp 11 question tes
machinescheduling
- 這是一個採用greedy的方法所寫的machine scheduling，可讓n件工作分配給n台machine，且每台machine最多做一件工作，此程式能在夠用最少的機器來完成所有工作-This is a method written by greedy machine scheduling, the job can be assigned to n n Taiwan machine, and each machine up to do a job, the program can at le
Greedy-algorithm
- 贪心算法法，算最优活动安排，主要体现贪心算法思想。-The greedy method, the optimal arrangements
duojidiaodu
- 用贪心法求解多机调度问题。两个机器，调度多项不同时长的作业。每个作业有两个子作业，后一项子作业必须在前一项子作业完成之后才能操作。合理安排这些作业的顺序。使得总时间最短。-Greedy method for solving the multi-machine scheduling problem. Two machines, scheduling a number of long jobs simultaneously. Each job has two sub-operations, afte
test
- 用贪心法解决加油站问题（c语言编写），希望能给大家带来帮助-Greedy method gas station problem
Loading
- 使用贪心法（首先装载最轻的集装箱）实现最优装载算法。-Use the greedy method (first load containers lightest) to achieve optimal loading algorithm.
arrange-meetting-room
- 贪心法 会场安排问题 非常实用 初学者必看的-Greedy method is very useful for beginners venue arrangements must-see
shortest-road
- 本实例主要是利用贪心法来求解单源点最短路径的判断-This example is the use of the greedy method to solve the single source point of the shortest path of the judge
tan-xin-suan-fa
- C语言结构化实现贪心算法，利用贪心策略解决背包问题。现有载重为M公斤的背包和n种货物。第i种货物的重量为Wi，它的总价值为Pi，假定M、Wi、Pi均为整数。设计程序给出装货方法，使装入背包的货物总价值达到最大-Using the greedy strategy to solve knapsack problem. Existing load for M kg backpack and n kinds of goods. The kind of the weight of the goods as
dijkstra
- 迪杰斯特拉算法计算最短路径Dijkstra算法是由E.W.Dijkstra于1959年提出，又叫迪杰斯特拉算法，它应用了贪心算法模式，是目前公认的最好的求解最短路径的方法。算法解决的是有向图中单个源点到其他顶点的最短路径问题，其主要特点是每次迭代时选择的下一个顶点是标记点之外距离源点最近的顶点。但由于dijkstra算法主要计算从源点到其他所有点的最短路径，所以算法的效率较低。-Dijkstra shortest path algorithm Dijkstra algorithm is prop
Neighborhood-rough-set
- 邻域粗糙集属性约简程序，约简方法为胡清华的前向贪心算法，包含求正域，属性重要度计算及最后约简出的重要属性。-Neighborhood rough set attribute reduction program, before the reduction method for qing-hua hu to the greedy algorithm, contains positive region, calculation and the reduction of attribute import
caffe_rtpose-master
- 姿态估计 该文章出自2017年的CVPR，Realtime Multi-Person 2D Pose Estimation using Part Affinity Field(We present an approach to efficiently detect the 2D pose of multiple people in an image. The approach uses a non- parametric representation, which we refer to
67373
- 贪婪随机自适应搜索法(GRASP)，使用随机化的最小最小完成时间算法来产生问题的初始解,再通过变邻域下降算法来改进这个解。(Greedy random adaptive search method)
6-8
- 贪婪法解决背包问题（局部最优解） 输入项数和重量 输出需要使用的背包数(Greedy method for solving knapsack problem (local optimal solution))
贪心法求背包问题
- 贪心法求背包问题，如何选择使得背包中物品价值最大(A greedy method for the problem of knapsack)
BP
- 除匹配追踪类贪婪迭代算法之外，压缩感知重构算法另一大类就是凸优化算法或最优化逼近方法，这类方法通过将非凸问题转化为凸问题求解找到信号的逼近，其中最常用的方法就是基追踪(Basis Pursuit, BP)，该方法提出使用l1范数替代l0范数来解决最优化问题，以便使用线性规划方法来求解(In addition to match-tracking greedy iterative algorithms, another major category of compressed-perceptual