搜索资源列表
切割
- 这是一个分治解决的零件切割问题:给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小?加上一个小界面-This is a solution to the partition cutting parts : a given width of the rectangular plate W, the height of rectangular plat
零件切割问题
- 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。要求求出一种切割法使得所使用的矩形板的高度h最小.用递归及分治法解此问题-given a width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut ou
MaxStream
- 学习VC的时候写的,求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.
fenzhi
- 零件切割问题: 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小? 任给一个输入实例,能输出切割所需要的实际高度并能用图形演示切割的过程-cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestri
基于网络最小割计算稠密深度图的全局优化方法
- 一种基于最小割的稠密视差图恢复算法 摘要:针对经典最小割算法计算量大和适应性不足的问题,提出一种改进的基于网络最小割计算稠密深度图的全局优化方法。,Based on the minimum cut of a dense disparity map algorithm to restore
max-flow-min-cut-theorem
- 初学最大流最小割的几个很有用的参考资料,详细介绍了它的应用,很有帮助哦!-Maximum flow minimum cut beginner several useful references, details of its application, very helpful Oh!
RamdomMincut
- 最小切割的近似算法。希望能够对大家有所参考-Minimum cut approximation algorithm. We hope to be able to reference
Maxiflowminicut
- 最大流和最小截算法,在这个函数的编制中存在一个细节,当任取一个已标号未检查的点的时候,我取的最靠前的点。如果加进随机选取的语句,每次运行程序可能会出现不同的最大流结果。-Maximum flow and minimum cut algorithms, in this function exists in the preparation of a detail, if any label does not take a check point has been, I get the most fr
3041
- poj 第3041_Asteroids题,最小顶点覆盖 网络流 最小割 邻接表-poj first 3041_Asteroids problem, minimum vertex cover network flow minimum cut adjacency list
zuidaliu
- 最大流最小截问题,用matlab编写的,rar中有说明,较清晰-Maximum flow minimum cut problem, written with matlab, rar have stated more clearly
MaxFlow
- 最大流最小割 可以测试某一个特定的图 也可以随机生成n个顶点的图和k条边 用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
cut-the-minimum-cut-problem
- cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T,使s Î S , t Î T ,且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E)
cutcake-c
- 切蛋糕c语言实验源码,内容为:一个矩形蛋糕,长宽都是正整数,要求用户输入蛋糕的长和宽,并且由用户决定切分成多少块,编写一个函数求怎样切割使得最大的那一块面积最小,并输出最大的那一块的面积。-Cut the cake experiment c language source code, content: a rectangular cake, length and width are positive integers, requiring the user to enter length and
Graph-theory-algorithm-set
- 对matlab解决图论问题的算法做个汇总。主要包括:顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m
algo004
- 斯坦福机器学习公开课作业求最小割的作业答案,python实现,运行结果已经经过验证-Stanford Machine Learning Homework for the minimum cut open job answer, python implementation, the results have been proven
zuidaliu
- 最大流最小截问题,用matlab编写的,rar中有说明,较清晰-Maximum flow minimum cut problem, using matlab prepared, rar have stated more clearly
buttord
- 本程序用来求解巴特沃斯模拟滤波器的最小阶数和截止频率及求离散系统的输出-This procedure is used to solve the minimum Butterworth analog filter cut-off frequency and order and for discrete system output
Multi_link_sim_v2
- Routing of packets has been the primary method by which data have been transmitted across packet networks, such as the Internet. When multiple users are interested in the same data the same source, multicast routing is typically used. However, routin
Maximum flow / min cut
- Maximum flow / minimum cut through path algorithm
hsjqtsnz
- 直线阵采用切比学夫加权控制主旁瓣比,最大似然(ML)准则和最大后验概率(MAP)准则,包括最小二乘法、SVM、神经网络、1_k近邻法,matlab开发工具箱中的支持向量机,调试通过可以使用,最小均方误差(MMSE)的算法。-Linear array using cut than learning laid upon the right control of the main sidelobe ratio, Maximum Likelihood (ML) criteria and maximum