搜索资源列表
FLch5RMLeg2
- 用matlab仿真的递推极大似然法辨识程序，可用来进行系统辨识，很好用-simulation using Matlab Recursive maximum likelihood method identification procedures, which can be used for system identification, good use
迷宫求解(wjluo)
- 三种算法实现的迷宫出路求解，枚举、递归、还有栈。-three Algorithm way to solve the maze, enumeration, recursive, there are stacks.
IVMETHODFORIDENTIFICATION
- 用辅助变量法递推算法估计模型的参数，此法一般不用，但当其他方法效果不理想时可以试用-Auxiliary variable recursive algorithm estimate model parameters, the law generally does not, But other method is not ideal when probation
FORGETMETHODFORIDENTTIFICATION
- 遗忘因子法递推算法用于估计数学模型的参数，精确度较高-Fvrls recursive algorithm mathematical model used to estimate the parameters of the higher precision
AIbashuma
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient
AIbashumaJava1
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient
ReBEL_0-2-6
- ReBEL is a Matlabtoolkit of functions and scr ipts, designed to facilitate sequential Bayesian inference (estimation) in general state space models. This software consolidates research on new methods for recursive Bayesian estimation and Kalman
Java语言TSP递归程序的优化
- 因为递归程序运行的效率一般都比较低,本程序用java语言来实现TSP递归程序的优化-because recursive program run average efficiency are low, the procedure used java language to achieve TSP recursive process optimization
migongxunlu.rar
- 实现迷宫自动寻路的一个机器人算法，使用了递归算法及堆栈操作，很具有参考价值,Automatically achieve the maze routing algorithm for a robot, the use of a recursive algorithm and the stack operation, is a reference value
mc-problem
- N个传教士和野人的渡河问题，采用递归算法-Missionaries and the savages of N crossing problem, using a recursive algorithm
Recurrent-T-S-FNN
- 递归T-S模糊神经网络学习算法，用遗传算法优化参数-Recursive TS fuzzy neural network learning algorithm, using genetic algorithm parameters
dynamechs_4.0pre1
- 采用AB递推算法对移动机器人进行快速的动力学仿真。-AB recursive algorithm used to fast mobile robot dynamics simulation.
FORGETMETHODFORIDENTTIFICATION
- 遗忘因子法递推算法用于估计数学模型的参数,精确度较高!-Forgetting factor recursive algorithm method used to estimate the parameters of the mathematical model, high accuracy!
nnfpe
- This function calculates Akaike s final prediction error ％ estimate of the average generalization error for network ％ models generated by NNARX, NNOE, NNARMAX1+2, or their recursive ％ counterparts. ％ ％ [FPE,deff,varest,H] = nnfpe(method,Ne
duobuyuce
- 多部预测自校正控制的算法仿真程序，用matlab写的。用的RLS带遗忘的最小二乘法递推。-Forecast for more than self-tuning control algorithm simulation program, written using matlab. Used in the RLS with forgetting recursive least square method.
Recursive.algorithm.game
- Recursive algorithm for nine serial game九连环游戏算法递归实现 -Recursive algorithm for nine serial game
not-recursive-realized
- 该程序是分段函数： akm(m,n){ n+1 m =0 akm(m-1,1) m!=0,n=0 akm(m-1),(akm(m,n-1)) m!=0,n!=0 实现递归和非递归的算法 非递归算法可能使计算时间减少-The program is piecewise function: Akm (m, n) { N+ 1 m = 0 Akm (m-1, 1) m! = 0, n = 0 Akm (m-1) (akm (m, n-1)) m! = 0, n.=
recursive-divide-and-conquer
- 算法设计课件(第二章递归与分治)，主要讲述递归与分治-Algorithm courseware design (Chapter II recursive divide and conquer), focuses on the recursive divide and conquer
Recursive-least-squares
- 递归最小二乘算法，来至MIT大学的wingate教授，含3个源码-rls.m- Basic recursive least squares. qr_rls.m- Square-root version of RLS using a QR decomposition. bqr_rls.m- Block square-root version of RLS using a QR decomposition (you can add multiple rows at a time).
Recursive-least-squares-procedure
- 本案例利用递推最小二乘程序对系统进行系统便是处理-In this case the use of recursive least squares procedure of the system is processing system