搜索资源列表
求解约瑟夫问题
- 求解约瑟夫问题。设有n个人围成一个圆圈坐下,对所有围从的人从某个位置开始编号为1,2,3,……,n,从编号为1的人开始报数1,报数依交进行,报数n的人即出列,下一个人从1开始报数,再报数m的人便是第二个出列的人如此重复下去,直到最后一个人出列为止,于是便得到一个出列的顺序,这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the star
tsp(2)
- 本程序实现了多城市的tsp问题(即旅行商问题)的遗传算法-the process of multi-city tsp (ie, the traveling salesman problem) Genetic Algorithm
ptfsf
- The tar file contains the following files: ptfsf.c: heart of the perfect TFSF code ptfsf.h: header file for same ptfsf-demo.c: FDTD code which demonstrates use of perfect TFSF code. Essentially this program used to generate results shown
global_mini
- 寻找函数的全局极小值,global minimization of contrast function with random restarts the data are assumed whitened (i.e. with identity covariance matrix). The output is such that Wopt*x are the independent sources.-Find function of the minimum value of the overa
c++neuralnetworkdevelopmentpakage
- annie is an ANN, ie, Artificial Neural Network library developed in C++. It can be used to implement various kinds of neural networks like Multi-Layer Perceptron, Radial basis function networks, Hopfield networks etc.-ANN, ie, Artificial Neural Netwo
MPEGBuilder1Executable
- 數字圖像水印技術,是將代表著作權人身份的特定信息(即數字水印),按照某種方式植 入電子出版物中,在產生版權糾紛時,通過相應的算法提取出該數字水印,從而驗證版權的 歸屬,-digital image watermarking technology, on behalf of the copyright status of specific information (ie digital watermarking), according to some form implanted electron
libMeridian-1.0.tar
- 件主要用于帮助计算机爱好者学习蚁群算法时做有关蚁群算法的试验。蚁群算法作为一种优秀的新兴的算法,具有非常广的应用前景,越来越多的人开始学习蚁群算法,因此本软件也有推广前景。 本软件除了用于教学目的外,还可用于解决实际生活中的与TSP(即,旅行商问题)问题相关的问题。-mainly used to help computer enthusiasts Ant learning algorithm to do the ant algorithm tests. Ant algorithm is a go
MyloopToolbar
- 自制IE插件,实现在www.mailu.cn搜索的动能 -homemade IE plug-ins, to achieve the kinetic energy www.mailu.cn Search
DataStructureAndArithmetic
- 《数据结构及应用算法教程》配书光盘 1. 算法一览是由HTML页面形式的文件组织的,使用时系统需要安装Microsoft IE 5.0、Office 2000 Word和PowerPoint。读者可以从“算法一览”文件夹下的index.htm文件开始浏览。2. “程序设计示例”文件夹下汇集了本书第10章中八个示例的源代码。读者可以在配有Microsoft Visual C++5.0以上版本的环境中,通过重新建立工程文件来编译和运行。具体的细节步骤,可继续阅读“程序设计示例”文件夹下的Readme
CPP1 顺序表的基本操作实现实验
- 一、顺序表的基本操作实现实验 要求:数据元素类型ElemType取整型int。按照顺序存储结构实现如下算法: 1)创建任意整数线性表(即线性表的元素值随机在键盘上输入)的顺序存储结构(即顺序表),长度限定在25之内; 2)打印/显示(遍历)该线性表(依次打印/显示出表中元素值); 3)在顺序表中查找第i个元素,并返回其值; 4)在顺序表第i个元素之前插入一已知元素; 5)在顺序表中删除第i个元素; 6)求顺序表中所有元素值(整数)之和; 二、链表(
pll.rar
- A Matlab scr ipt to simulate a Phase-Locked Loop (PLL). This is a type II PLL ie it has two integrators (one of these is the VCO itself). It is simulated with an FM (frequency modulation) input. The output is the demodulated baseband signal,A Matlab
atan_lgam1_Arcsn
- 该版本的单复变程序增加了三个函数:复反正切函数atan(x+yi),实Γ函数,实反椭圆正弦函数(即雅可比分号形式的第一类[不完全]椭圆积分)Arcsn(e x),0<=e<=1,-1<=x<=1。-This version of the single complex variable program adds three functions: complex tangent function atan (x+ yi), the real function of Γ, th
SOR
- 松弛因子的介绍(“松弛迭代法是高斯-塞德尔迭代法的一种加速方法,基本思想是将高斯-塞德尔迭代法得到的第k+1次近似解向量与第k次近似解向量作加权平均,当权因子(即松弛因子)w选择是适当时,加速效果很明显。因此这个方法最关键的是如何选取最佳松弛因子。")和算法。-Relaxation factor of the introduction (" relaxation method is the Gauss- Seidel iteration method for an accelerated
dijstra
- 网络层的状态路由法,即dijkstra算法-State routing method, ie dijkstra algorithm
GAOT
- 遗传算法matlab工具 1.工具箱文件拷贝至Matlab文件夹下,具体路径为:C:\program files\MATLAB\R2009a\toolbox。 2.工具箱路径加入Matlab文件路径之中。 流程为:File-->Set Path-->Add Folder。即,将C:\program files\MATLAB\R2009a\toolbox\文件夹加入该路径系统中。 3 重新启动Matlab,运行即可。 4 一般情况下,会出现如下情况。 安装遗传工
Tokenringalgo
- Token ring algorithm, using the concept of tokens to eliminate the problem of critical section ie preventing deadlock condition.
SeDuMi_1_3
- SeDuMi 是一个求解半正定规划的算法包,这是项目最新发布的源代码。-Welcome to SeDuMi 1.3 SeDuMi is a Matlab Toolbox for Linear, Second order, Semidefinite or mixed problems. It can handle free variables and complex data as well. To obtain the latest version of SeDuMi,
5-1
- 简单有限元计算程序。 NJF---结点自由度数 E---弹性模量 NE---单元数 T---板厚度 VM---泊松比 z---实型二维数组,用来存放结点坐标 ZJ---实型二维数组,用来存放每个约束自由度方向和该方向的约束值, ie---实型二维数组,存放布尔矩阵 p---实型一维数组,先存放等效结点载荷,解完方程后存放输出的结点位移 a,b,a---实型数组,存放各个单元的面积及由结点坐标计算的bi,bj,ci,cj g---实型数组,存放单刚子块
marq
- % Train a two layer neural network with the Levenberg-Marquardt % method. % % If desired, it is possible to use regularization by % weight decay. Also pruned (ie. not fully connected) networks can % be trained. % % Given a set of cor
rpe
- Train a two layer neural network with a recursive prediction error % algorithm ("recursive Gauss-Newton"). Also pruned (i.e., not fully % connected) networks can be trained. % % The activation functions can either be linear or tanh. The netw