Welcome![Sign In][Sign Up]
Location:
Search - nn

Search list

[Other resourceNN+GA

Description: 1,改进BP神经网络在股市预测中的应用.2,基于MATLAB工具箱的开采煤层自燃危险性预测.3,基于改进的神经网络的电力系统负荷预报.4,基于神经网络的灌溉用水量预测.5,基于遗传算法改进BP网络的地表沉陷预计.6,利用遗传算法改进BP学习算法.7,模糊神经网络在电力市场短期负荷预测中的应用.8,神经网络学习算法存在的问题及对策.9,遗传神经网络在电力系统短期负荷预测中的应用.10,应用改进BP神经网络进行用水量预测.11,用遗传算法改进的BP模型在刹车系统诊断中的应用研究.12,遗传算法改进的BP神经网络对汛期三门峡水库泥沙冲淤量的计算13,基于遗传算法的人工神经网络学习算法14.自适应遗传算法优化管网状态估计神经网络模型.15,基于GA_RBF神经网络的电梯交通流模式识别的研究
Platform: | Size: 738326 | Author: 军军 | Hits:

[Other resourcemerz.tar

Description: nn modelling and auto-pid controller
Platform: | Size: 13999 | Author: fling | Hits:

[Other resourcenn

Description: 这是一个利用Visaual C++完成的基于神经网络方法的专家系统源代码
Platform: | Size: 26677 | Author: lanlan | Hits:

[Other resourceNN-BP

Description: 众所周知,MATLAB是一个功能强大的数学软件,擅长于用矩阵运算完成各种数学功能。但是其程序需要在MATLAB环境下解释执行,效率不高。如果能将它强大的函数库用于C语言,利用C来编译执行,MATLAB将能发挥更大的作用。所以,MATLAB从5.0开始已经提供了与外部C/C++程序的应用程序接口,为利用C语言调用MATLAB的函数提供了可能。
Platform: | Size: 2583 | Author: rolandwen | Hits:

[Other resourcenn-pid

Description: 神经网络与pid混合控制源程序,可以很好的解决非线性控制问题
Platform: | Size: 1141 | Author: 李凯 | Hits:

[Other resourceAI-NN

Description: 一个完整BP神经网络源代码,包括数据和说明文档,很有用的。
Platform: | Size: 333420 | Author: flying | Hits:

[Other resourcenn-matlab_Code_

Description: 遗传算法初始化网络权值及其阈值参数 提高控制性能
Platform: | Size: 529903 | Author: zxx | Hits:

[Windows Developrtree_src_1.0.1

Description: A disk based production quality RTree based upon Guttman?s quadratic split algorithm having following features: Buffering with dirty write, Index joins, Tree Seeding, Window and NN queries, Runtime STR Packing capability, Completely Thread safe.
Platform: | Size: 417869 | Author: 刘宇 | Hits:

[Other resourcenn

Description: 利用matlab编写的神经网络算法,经过测试速度快效果好。
Platform: | Size: 413717 | Author: zhangqing | Hits:

[Windows Developsar_project

Description: source code of NN applied in DAC-Based Successive Approximation
Platform: | Size: 1724 | Author: stranger | Hits:

[Other resourcematlab-ga-nn

Description: 经典的神经网络matlab程序。-classical neural networks Matlab procedures.
Platform: | Size: 4644 | Author: 钱阳 | Hits:

[Speech/Voice recognition/combineFreeSpeech-0.1.2.tar

Description: 语音识别方面的开发包,有助于设计HMM,NN和VQ。它是开放源码的。-the development kits, contribute to the design of HMM, NN and VQ. It is open source.
Platform: | Size: 749703 | Author: 吕学刚 | Hits:

[Other resourcekmeansjava

Description: 这是一个我自己编写的JAVA程序,可以运行的。思想是将KMEANS和神经网络结合起来实现模式的分类。-This is a Java program writen by meself which can be run.The chief concept is to combine KMEANS and NN to achieve classification of pattens.
Platform: | Size: 19803 | Author: 丽云 | Hits:

[Other resource12111

Description: 一个关于神经网络遗传算法的源程序,对于初学者肯定有帮助-A source code about NN(nerve network),it is helpful for beginners
Platform: | Size: 4119 | Author: 叶勇 | Hits:

[SourceCodezuijiasuanfa

Description: #include #include #define M 20 #define N 3 int mm[M]={0,0,0,2,3,1,0,4,2,3,2,1,0,3,2,2,1,3,0,1}; int nn[N]; int number; void Xunhuan(void); void FIFO(void); void Best(void); void LRU(void); int main() { char ss[1]; int i,j, *p=nn; int c, k=0; for(i=0;i
Platform: | Size: 2853 | Author: lipman1987 | Hits:

[CSharp迷宫求解的非递归算法

Description: #include #include #include #define N 20 int aa[N][N]; int yes=0; int x[100][2],n=0; void fun1(int (*aa)[N],int (*a)[N]); int fun(int (*a)[N],int i,int j); void begain(int (*t)[N]); void pr(int (*t)[N],int nn); void win(int (*t)[N]); void lose(); void main(void) { int t[N][N]; begain(t); pr(t,0); fun(t,1,1); if(yes) win(t); else lose(); getch(); } void fun1(int (*aa)[N],int (*a)[N]) { int i,j; for(i=0;i<N;i++) for(j=0;j<N;j++) aa[i][j]=a[i][j]; } int fun(int (*a)[N],int i,int j) { if(i==N-2&&j==N-2) { yes=1; return; } a[i][j]=1; fun1(aa,a); if(aa[i+1][j+1]==0&&!yes) { fun(aa,i+1,j+1); if(yes) {x[n][0]=i,x[n++][1]=j;return;} } fun1(aa,a); if(aa[i+1][j]==0&&!yes) { fun(aa,i+1,j); if(yes) {x[n][0]=i,x[n++][1]=j;return;} } fun1(aa,a); if(aa[i][j+1]==0&&!yes) { fun(aa,i,j+1); if(yes) {x[n][0]=i,x[n++][1]=j;return;} } fun1(aa,a); if(aa[i-1][j]==0&&!yes) { fun(aa,i-1,j); if(yes) {x[n][0]=i,x[n++][1]=j;return;} } fun1(aa,a); if(aa[i-1][j+1]==0&&!yes) { fun(aa,i-1,j+1); if(yes) {x[n][0]=i,x[n++][1]=j;return;} } fun1(aa,a); if(aa[i+1][j-1]==0&&!yes) { fun(aa,i+1,j-1); if(yes) {x[n][0]=i,x[n++][1]=j;return;} } fun1(aa,a); if(aa[i][j-1]==0&&!yes) { fun(aa,i,j-1); if(yes) {x[n][0]=i,x[n++][1]=j;return;} } fun1(aa,a); if(aa[i-1][j-1]==0&&!yes) { fun(aa,i-1,j-1); if(yes) {x[n][0]=i,x[n++][1]=j;return;} } } void begain(int (*t)[N]) { int i,j; system(cls); randomize(); for(i=0;i<N;i++) { for(j=0;j<N;j++) { if(i==0||i==N-1||j==0||j==N-1) t[i][j]=1; else if(i==1&&j==1||i==N-2&&j==N-2) t[i][j]=0; else t[i][j]=random(2); } } } void pr(int (*t)[N],int nn) { int i,j,ii; textcolor(RED); gotoxy(1,1); for(i=0;i<N;i++) { for(j=0;j<N;j++) { if(nn!=1) printf(%2d,t[i][j]); else { for(ii=0;ii<n;ii++) { if(x[ii][0]==i&&x[ii][1]==j) { cprintf(%2d,t[i][j]); break; } } if(ii<n) continue; if(i==N-2&&j==N-2) cprintf( 0); else printf(%2d,t[i][j]); } } printf(\n); } } void win(int (*t)[N]) { int i,j,ii,jj; for(i=0;i<n-1;i++) for(j=i+1;j<n;j++) if(x[j][0]==x[i][0]&&x[j][1]==x[i][1]) { for(jj=j,ii=i;jj=0;i--) printf(%3d%3d->,x[i][0],x[i][1]); printf(%3d%3d\n,N-2,N-2); t[1][1]=0; pr(t,1); } void lose() { printf(\nNot find way!\n); }
Platform: | Size: 854 | Author: 461600486@qq.com | Hits:

[AI-NN-PRbp

Description: bp神经网络源程序--A BP NN code
Platform: | Size: 7168 | Author: 站长 | Hits:

[AI-NN-PRnn

Description: 一个VC编写的神经网络算法程序,对学智能算法的朋友很有用。-a VC prepared by the neural network algorithm procedures, intelligent algorithm friends useful.
Platform: | Size: 55296 | Author: | Hits:

[AI-NN-PRhopfield nn

Description: Hopfield Model神经网络-Hopfield neural network
Platform: | Size: 18432 | Author: 高山 | Hits:

[Mathimatics-Numerical algorithms040320161

Description: 在n×n 格的棋盘上放置彼此不受攻击的车。按照国际象棋的规则,车可以攻击与之处 在同一行或同一列上的棋子。在棋盘上的若干个格中设置了堡垒,战车无法穿越堡垒攻击别 的战车。对于给定的设置了堡垒的n×n格棋盘,设法放置尽可能多彼此不受攻击的车。用概率算法实现的!-n n grid placed on the chessboard of each other against attack vehicles. According to the rules of chess, with cars can attack at the same firms listed on the same or a pawn. On the chessboard of several grid is set fortress and tank attacks can not be fortress through other vehicles. For a given set of a bastion of n n Lattice chessboard, trying to put as much as possible not to attack each other's cars. Using probabilistic algorithm!
Platform: | Size: 1024 | Author: 王乐 | Hits:
« 1 2 ... 5 6 7 8 9 1011 12 13 14 15 ... 49 »

CodeBus www.codebus.net