搜索资源列表
R-Opt-Lin-Kernighan
- Lin-Kernighan的R-Opt算法。主要思想是CLK，小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.
ANAL
- 将免疫算法应用于神经网络中，在油色谱的数据处理中的想法-The immune algorithm is applied to neural networks, in the oil chromatography data processing in the idea of
157
- Encryption algorithms are becoming more necessary to ensure data is securely transmitted over insecure communication channels. FOX is a recently developed algorithm and its structure is based on the already proven IDEA (International Data E
TSPmainidear
- 使用遗传算法对TSP问题进行设计的主要思路的文档记录是目前比较简单实用的方法-TSP problem using genetic algorithm to design the main idea is relatively simple and practical method.
stack
- C++ Interface Class This C++ code is intended to be a tutorial. It is an extension of the idea presented in Item 42 of Scott Meyer s "Effective C++", 2nd Edition. In his discussion he creates a generic stack class to contain pointers-to-objects. Hi
Tree
- 用递归调用的思想创建二叉树并对其进行先序、中序以及后序遍历-Recursive call with the idea to create a binary tree and gain first-order, middle order, and postorder
golden_cut_method
- 2． 黄金分割法的的核心思想是逼近，而最终结果的精确程度取决于相对精度e的大小，e越小，结果越精确，迭代次数越多，这一点从图一的程序运行结果中可以很明显的看出。 3． 程序运行过程中首先输入初始区间[0，1]，然后输入迭代后最后区间的长度0.2，最后得出极小值和极小值点。 -2. Golden section method is the core idea of approximation, while the final result depends on the precise re
不使用小波工具箱的快速小波变化
- 该程序不使用matlab自带的程序，自主编写，进行简单更改可以实现多中功能，算法思想是滤波器的实现！-The program does not use matlab own procedures, self-writing, more than a simple change in function can be achieved, the algorithm idea is the realization of filters!
IIR
- IIR数字滤波器的特点是h(n)为无限长序列。设计的基本思想是：模拟系统与离散系统存在着互相模仿的理论基础，所以可以让数字滤波器的特性去模仿一个模拟滤波器的特性，得到数字滤波器的H(z)，H( )之间的变换关系。设计时，先设计一个模拟滤波器的传递函数 ，然后通过s变量与z变量之间的变换关系求出数字滤波器的系统函数H(z)。-IIR digital filter is characterized by h (n) for infinitely long sequence. The basic id
blurMetric
- The idea is from "The Blur Effect: Perception and Estimation with a New No-Reference Perceptual Blur Metric" Crété-Roffet F., Dolmiere T., Ladret P., Nicolas M. - GRENOBLE - 2007 In SPIE proceedings - SPIE Electronic Imaging Symposium Conf H
SPIHT
- SPIHT多级树集合分裂算法的基础知识，讲解详细，适合于入门者理解算法的基本思想。-SPIHT multi-level tree splitting algorithm is a collection of basic knowledge, to explain in detail, suitable for beginners to understand the basic idea of the algorithm.
imageplanerepresentation
- this program gives the idea about how image is represented in different plane in an 8bit mode.
zhaolingqian
- 本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.
Finite_difference_method
- 有限差分法 微分方程和积分微分方程数值解的方法。基本思想是把连续的定解区域用有限个离散点构成的网格来代替， 这些离散点称作网格的节点；把连续定解区域上的连续变量的函数用在网格上定义的离散变量函数来近似；把原方程和定解条件中的微商用差商来近似， 积分用积分和来近似，于是原微分方程和定解条件就近似地代之以代数方程组，即有限差分方程组 ， 解此方程组就可以得到原问题在离散点上的近似解。然后再利用插值方法便可以从离散解得到定解问题在整个区域上的近似解。 -Finite Difference Me
abc
- 关于vb的一些代码 C#制作的拼图游戏C#制作的拼图游戏C ·拼图游戏，可以回退等。练手用的。 ·-open i think you shoud open idea prepared by the pivotal games, and we can usually common are very similar. readers can learn code, the reference program, of course, can also entertainment fo
123
- 推算表,还没有写完,下面没有了思路了,我会继续写完他的.-Projection table, has not yet finished, the following no idea, and I will continue to finish him.
FFT
- 快速傅立叶变换,快速傅立叶反变换实现和基本思想。-Fast Fourier Transform, Fast Fourier inverse transform to achieve and the basic idea.
ga-base
- 基本遗传算法的MATLAB编程，未利用MATLAB工具箱，但更能帮助理解遗传算法的基本思想及其核心。-The basic genetic algorithm MATLAB programming, without the use of MATLAB toolbox, but the more help you understand the basic idea of genetic algorithms and its core.
Batch_hlb
- 一个批量调度的源代码,没有实际使用,但提供了一种实现的思路-A batch scheduling source code, no actual use, but provides a realization of the idea of
shouxieshibie
- 上午上课在稿纸上画了半天，整理下思路，下午动手写的，所有模块已大概成型，本着照顾后学者，以及资源共享的原则，贴上核心的bp算法部分，已经封装好了，使用可以直接调用。三层，基本三层就可以解决我们的这些简单的问题，输入为8×8，输出4，隐层数目conts num=8 还可进一步封装，const输入层节点，输出层节点。-Morning class in the writing paper drew a long time, under the idea of finishing the afterno