搜索资源列表
RSNA
- 待辨识对象参数a=[1 -1.5 0.7] b=[1 0.5] 输入采用长度L=400的白噪声序列，输出 ，输入和输出数据均含不相关随机噪声，ρ（k）=1/k。利用上述递推公式，辨识系统参数。-To identify the object parameters a = [1-1.5 0.7] B = [1 0.5] Input the length L = 400 white noise sequence, the output, the input and output data
RELS
- 增广最小二乘的递推算法对应的噪声模型为滑动平均噪声，扩充了参数向量和数据向量H（k）的维数，把噪声模型的辨识同时考虑进去。最小二乘法只能获得过程模型的参数估计，而增广最小二乘法同时又能获得噪声模型的参数估计，若噪声模型为平均滑动模型，，则只能用RELS算法才能获得无偏估计。当数据长度较大时，辨识精度低于极大似然法。-Augmented least squares of recursion algorithm corresponding noise model for moving average
RFF
- 辨识模型与遗忘因子法所用模型相同，其中， 0 ≤μ≤1为遗忘因子， 此处取0.98。 数据长度L=402。一次算法和递推算法结果基本一致，但递推算法可以实现在线实时辨识，而且可以减少计算量和存储量。-Identification model and forgetting factor method used the same model, among them, 0 or less or less 1 μ for forgetting factor, here take 0.98. Data l
Determinant-calculation
- 关于行列式计算的C源代码，用的是行列式展开法，用到了递归，很完善，值得参考-Determinant calculation of C source code, with determinant expansion method, use recursion, it is perfect, it is worth Reference
FagInterfaz
- Full Avaiabiliti Group Network Kaufmann Roberts Recursion calculator
Linear-Prediction
- Linear Prediction using Levinson Durbin Recursion and Lattice Filters
maze
- 建立一个迷宫，并用递归算法找出一条走出迷宫的路线。-Build a maze and find a way out with recursion method.
Fibonacci-series
- 斐波那契数列 递归调用，主要用于了解递归用法-The Fibonacci series recursive calls, mainly used to understand recursion usage
Nqueen
- 给出了用三种方法实现的N皇后，包括循环、递归、位运算等，方便初学者进行研究学习。-Three ways to achieve the N-Queens, including loops, recursion, bit operation, easy for beginners to study learning.
kuai_suan_24
- 小时候玩过的加减乘除快算24游戏。这里的算法不是用的正统的递归或穷尽。 -The child played the addition and subtraction multiplication and division as fast as count 24 games. Here algorithm is not used in orthodox recursion or exhaustive.
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
introduction-of-adp
- 自适应动态规划介绍。一种求解动态规划方法HJB方程的自学习控制算法，称其为自适应动态规划算法。所提的算法可以用来解决未知离散时间非线性系统的最优控制问题，同时给出了该控制算法的收敛性证明。算法的实现用到了三个神经网络，在递推的每一步分别用来近似性能指标函数、最优控制律和未知非线性系统。-Adaptive Dynamic Programming introduction. Dynamic programming method for solving the HJB equation self-le
calcu
- 一个使用递归算法和堆栈结构实现的计算器。将中缀表达式转化为后缀表达式后再使用递归和堆栈实现。-A stack structure using a recursive algorithm and implementation of the calculator. The infix expression into postfix expression before using recursion and stack implementation
maxfieldsum
- 用分治法解决最大子段和问题,利用了递归和合并，使问题能够简易求解-Solve the problem with the largest sub-segment and divide and conquer method, the use of recursion and merge so that the problem can be solved simple
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and
Maze
- 使用递归方法与非递归方法求解迷宫问题。内容涉及递归的消去、属于数据与算法课程。-Use recursive and non-recursive method for solving approach maze. Covering recursion elimination, part of the data and algorithms course.
chapter-2
- 算法设计与分析的 第2章 递归与分治策略.pdf-Design and Analysis of Algorithms Chapter 2 Recursion and divide and conquer strategy. Pdf
Tower-of-Hanoi
- 该文件包括了非递归、换位递归、汉诺塔、汉诺塔2、汉诺塔画图版、四塔、四塔2这7个c源文件-The document includes a non-recursive, transposition recursion, Tower of Hanoi, Hanoi Tower 2, Tower of Hanoi drawing version, four towers, four towers 2 7 c source files
Recursive
- 数据结构中各种递归利用的小例子，方便我们理解递归。-Data structure of recursive use small example, convenient we understand recursion.
diguishixianzhuanzhi
- 通过递归实现数组的转置操作。纯手工代码适合vs2013-Transpose operation achieved through an array of recursion. Handmade code for vs2013