搜索资源列表
anti-compile.c
- ead file \"YD.DOC\". Who is the intended user Beginners in assembly and programmers. Features of the program: Yilmaz Disassembler:is an interactive disassembler which lets the user be a part of the disassembling process,is flexible, the
max flow/min cut
- max flow/min cut 实现最大流最小割算法的程序
max-flow-min-cut-theorem
- 初学最大流最小割的几个很有用的参考资料，详细介绍了它的应用，很有帮助哦！-Maximum flow minimum cut beginner several useful references, details of its application, very helpful Oh!
maxflow-v3.0.src.tar
- 图像处理最大流最小割经典算法,适合初学者使用！-A classic max flow/min cut algorithm in image processing
Ford-Fulkerson
- Ford-Fulkerson Min cut / Max flow-Ford-Fulkerson Min cut/Max flow
newmaxflowaigorithm
- 实现了An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision [Yuri Boykov and Vladimir Kolmogorov]中的新的最大流算法，经过实验验证比传统的最大流算法效率更高-Achieved An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Mini
original_GraphCut
- An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
MaxFlowcpp
- max flow min cut in c++ code
graph-based-image-segmentation
- 五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperi
MaxCut
- This program implement the Max cut Max_Cut algorithm , as a deterministic algorithm using a pair wise method , which force the algorithm for deterministic solution with solution better then |E|/2 the graph is implemented using an adjacent matrix,
MaxMin
- Max-Min Algorithm for grid scheduling
Max-Cut-Solver
- 解最大割问题的matlab程序，对学习组合优化有一定帮助。-A Matlab program for maximum cut problem， it is useful to learn combinatorial optimization.
cross-Entropy
- The cross-entropy (CE) method attributed to Reuven Rubinstein is a general Monte Carlo approach to combinatorial and continuous multi-extremal optimization and importance sampling. The method originated from the field of rare event simulation, where
optimal-for-max-cut-problem
- 对最大割问题提出二次优化的算法，介绍了基于多项式优化的最大割问题-an optimal algorithm for max-cut problem
max-flow-min-cut
- max-flow/min-cut algo
algo-implementation-for-graph-cut
- version 3.01 of max-flow algo
TSPSearch
- c++使用禁忌算法解决MAX-CUT问题-c++ use tabu search algorithm to solve the problem of MAX-CUT
cut
- max no of fields or resulting line length.
max_cut_sdp
- FORM MATHWORKS SOLVING MAX CUT PROBLEMS USING SDP
simulated annealing algorithm
- 模拟退火算法的应用很广泛，可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1