搜索资源列表
模拟退火源码
- 模拟退火算法 模拟退火算法(Simulated Annealing,简称SA算法)是模拟加热熔化的金属的退火过程，来寻找全局最优解的有效方法之一。 模拟退火的基本思想和步骤如下： 设S＝{s1,s2,…,sn}为所有可能的状态所构成的集合， f：S—R为非负代价函数，即优化问题抽象如下： 寻找s*∈S，使得f(s*)＝min f(si) 任意si∈S （1）给定一较高初始温度T，随机产生初始状态S （2）按一定方式，对当前状态作随机扰动，产生一个新的状态S’ S’＝S＋sign(η).δ 其中δ
matlog
- 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Sho
minimalScreenSaver
- This class loads a texture file and prepares it to be used in OpenGL. It can open a bitmap or a targa file. The min filter is set to mipmap b/c they look better and the performance cost on modern video cards in negligible. -This class loads a fi
aodv
- opnet下修改AODV路由协议，将min hop routing 改为min cost routing，附说明文档-opnet to modify the AODV routing protocol, the min hop routing changed to min cost routing, attached documentation
mips16_functions_c32_example
- This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providin
ior44877
- This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providin
ADCDuringSleep
- This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providin
AN1004
- This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providin
ce51xv11
- This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providin
ce67xv11
- This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providin
mcFlo
- mcFlo reads a wflograph from stdin, computes a min cost maximum flow using the method specified by the argument and then prints the wflograph with the computed flow.
min-costflow.java
- min cost max flow template in java
Kruskal
- 编程实现Kruskal算法，生成最小代价生成树，其中利用最小堆算法实现。 （随机生成n个点，且随机生成k条边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected com
Prim
- 编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。 （其中随机生成点和边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。-Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for
0000437
- 2010年ICIP最新文章关于图像复原，提出了2D NHA算法，实验证明了该算法的优越性能。-In this study, we develop a technique for image restoration The proposed method is based on the 2D non-harmonic analy- sis (2D NHA). The 2D NHA algorithm assigns an initial value by using the spect
Heap-Sort-Algorithm-Pseudo-Code
- The heapsort algorithm can be divided into two parts. In the first step, a heap is built out of the data. In the second step, a sorted array is created by repeatedly removing the largest element from the heap, and inserting it into the arra
PSOANN
- This a PSO toolbox implementing Common, Clerc 1", and Trelea types along with an alpha version of tracking changing environments. It can search for min, max, or distance of user developed cost function. Very easy to use and hack with re
min
- 主要实现求钢管运输与订购的最小费用，并运用了floyd算法-The main requirements to achieve the minimum cost of transport and ordering steel, and use the floyd algorithm
UWB-based-sensor-networks-for-localization-in-min
- Wireless sensor networks (WSN) have attached a great attention in the last few years. WSN offer several advantages over the traditional sensor networks, such as elimination of costly wires, security and larger area coverage. In the last few years
Network-Optimization
- 国外权威讲解最优化问题的书籍，对最小费用流，最佳分配，最短路径等讲解非常透彻-A book for Network Optimization. It is very useful for min cost and min path problem