CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - Min
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - Min - List
[
Other resource
]
Max-IntMax-MinMin-Min
DL : 2
极小 算法(Min-Min)、极大极小算法(Max-Min)、最大时间跨度算法(Max-Int)三种典型的映射算法的算法原理以及计算程序
Update
: 2008-10-13
Size
: 106.53kb
Publisher
:
fuhaijun
[
CSharp
]
max flow/min cut
DL : 0
max flow/min cut 实现最大流最小割算法的程序
Update
: 2010-12-14
Size
: 14.65kb
Publisher
:
qinchanchan@163.com
[
Program doc
]
Min的关于三维模型的4个小工具介绍
DL : 0
Min的关于三维模型的4个小工具介绍与总结,有工具名称及使用方法,很好用的啊
Update
: 2011-03-23
Size
: 504.5kb
Publisher
:
nacy0807@126.com
[
AI-NN-PR
]
模拟退火源码
DL : 0
模拟退火算法 模拟退火算法(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(η).δ 其中δ为给定的步长, η为[-1,1]的随机数-simulated annealing algorithm (Simulated Annealing, or SA algorithm) is a simulation of heating molten metal in the annealing process, to find the global optimum one of the effective ways. Simulated Annealing basic ideas and the steps are as follows : S = (s1, s2, ..., sn) for all possible state posed by the pool, f : S-R non-negative cost function, that is abstract optimization problems are as follows : Find S* s, making f (s*) = min f (si) arbitrary si S (1) to set a higher initial temperature T, randomly generated initial state S (2) of a certain form, the current state of random disturbance, have a new state S 'S' = S+ sign (). delta where given for the step, [-1,1] Random Number
Update
: 2025-02-17
Size
: 54kb
Publisher
:
[
source in ebook
]
GA-min
DL : 0
遗传算法进行优化求多元函数 (Griewank Function)最小解问题-genetic algorithm optimization for multi-function (Griewank Function) Minimum solutions to the problems
Update
: 2025-02-17
Size
: 2kb
Publisher
:
林言
[
Other
]
MaximumFlow
DL : 0
最大最小流程序。包括最大流网络,最小费用最大流。算法的一些实现。-Max-min flow procedures. Including the maximum flow network, minimum cost maximum flow. Some of realize algorithm.
Update
: 2025-02-17
Size
: 108kb
Publisher
:
HuiCong
[
Special Effects
]
MinCutAlgorithm
DL : 0
这是自己用c#写的一段关于图的最小切的算法,主要参考了论文: 《An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision》 此文中的算法是目前比较优秀的最小切算法-This is their use of c# Write a paragraph on the minimum cut graph algorithm, the main reference of the thesis:
Update
: 2025-02-17
Size
: 3kb
Publisher
:
张曦
[
Special Effects
]
An_Experimental_Comparison_of_maxflow_aigorithm.ra
DL : 0
是基于Graph cuts 的源程序,用来求解Min-Cut/Max-Flow.-Graph cuts based on the source code for solving Min-Cut/Max-Flow.
Update
: 2025-02-17
Size
: 106kb
Publisher
:
余丽红
[
Algorithm
]
Max-IntMax-MinMin-Min
DL : 0
极小 算法(Min-Min)、极大极小算法(Max-Min)、最大时间跨度算法(Max-Int)三种典型的映射算法的算法原理以及计算程序-Minimal algorithm (Min-Min), max-min algorithm (Max-Min), maximum time-span algorithm (Max-Int) three typical mapping algorithm and the algorithm of the calculation program
Update
: 2025-02-17
Size
: 106kb
Publisher
:
fuhaijun
[
Documents
]
MinCut
DL : 0
Applications of min-cut model.
Update
: 2025-02-17
Size
: 497kb
Publisher
:
dongpei
[
Other
]
LDPC
DL : 1
LDPC Decoder for rate=1/2 Min-Sum, Sum-Product, Scaling Min-Sum Layered Decoding for Matlab Code
Update
: 2025-02-17
Size
: 6kb
Publisher
:
chris
[
Other
]
LDPCdemo
DL : 0
此代码是LDPC码进行BP算法的重要参考代码,价值很高!并且可以进行BP的改进算法min-sum BP算法的改进工作!参考的价值不错-This code is LDPC code BP algorithm important reference code, high-value! And BP can be improved algorithm of min-sum BP algorithm to improve the work! Reference to the value of good
Update
: 2025-02-17
Size
: 241kb
Publisher
:
力军
[
Communication-Mobile
]
PEG_LDPC
DL : 0
引入PEG(Progressive-edge-growth)算法来构造适合线性时间编码的LDPC校验矩阵,译码时采用简化最小和Min-Sum译码算法实现简化译码.仿真结果表明,该方法能够构造适合LDPC码的线性时间编码的下三角校验矩阵日,并且用此方法构造的LDPC码性能非常接近原来PEG算法构造的LDPC码.同时通过采用最小和Min-Sum算法降低译码复杂度.-The introduction of PEG (Progressive-edge-growth) algorithm to construct suitable for linear time encoding of LDPC check matrix, decoding simplified when the smallest and the Min-Sum decoding algorithm decoding simplified. Simulation results show that this method can construct LDPC codes suitable for linear time encoding on lower triangular calibration matrix, and constructed using this method the performance of LDPC code is very close to the original PEG algorithm constructed LDPC codes. At the same time through the use of the smallest and the Min-Sum decoding algorithm to reduce complexity.
Update
: 2025-02-17
Size
: 165kb
Publisher
:
卡卡
[
Data structs
]
Data_Struc
DL : 0
这个是严蔚敏版的数据结构上机教程中的部分源代码,都是自己写的,包括最短路径的dijkstra,floyd,最小生成树的prim,kruskal以及链表,Huffman Tree等等的c++代码-This is Yan Wei-min version of the data structure on the machine part of the tutorial source code, are written in their own, including the shortest path dijkstra, floyd, minimum spanning tree of the prim, kruskal as well as the list, Huffman Tree, etc. c++ code
Update
: 2025-02-17
Size
: 12kb
Publisher
:
wang yucao
[
matlab
]
mRMR_0.9_compiled
DL : 0
mRMR(min-redundancy max-relevance)的matlab程序-matlab program of mRMR(min-redundancy max-relevance)
Update
: 2025-02-17
Size
: 481kb
Publisher
:
reallycsc
[
JSP/Java
]
jquery-1.2.6.min
DL : 0
jquery-1.2.6.min为JQUERY框架语法的加载包,它集成了JAVASCRIPT语句-jquery-1.2.6.min
Update
: 2025-02-17
Size
: 16kb
Publisher
:
Andy Liu
[
JSP/Java
]
jquery-1.4.2.min
DL : 0
jquery-1.4.2.min.js--- --- --高效率版 [高效率实施] -jquery-1.4.2.min.js-------------- efficient version of [efficient implementation]
Update
: 2025-02-17
Size
: 23kb
Publisher
:
zhaohui
[
JSP/Java
]
jquery-ui-1.8.custom.min
DL : 0
jquery-ui-1.8.custom.min.js----定制版 [高效率实施]-jquery-ui-1.8.custom.min.js---- customized version of the [efficient implementation]
Update
: 2025-02-17
Size
: 47kb
Publisher
:
zhaohui
[
JSP/Java
]
min-costflow.java
DL : 0
min cost max flow template in java
Update
: 2025-02-17
Size
: 1kb
Publisher
:
moonto
[
Other
]
jquery.min
DL : 0
jquery min is a library for javascript
Update
: 2025-02-17
Size
: 32kb
Publisher
:
lukere
«
1
2
3
4
5
6
7
8
9
10
...
50
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.