搜索结果
找到约 834 项符合
step-Up 的查询结果
matlab例程 k-step ahead predictions determined by simulation of the % one-step ahead neural network predictor.
k-step ahead predictions determined by simulation of the
% one-step ahead neural network predictor. For NNARMAX
% models the residuals are set to zero when calculating the
% predictions. The predictions are compared to the observed output.
%
其他 this is a download speed up tool at the internet
this is a download speed up tool at the internet
软件工程 FOR ADS STUDY ,ABOUT ADS APPLY AND STEP.
FOR ADS STUDY ,ABOUT ADS APPLY AND STEP.
微处理器开发 up-techpxa270 bootloader 文件
up-techpxa270 bootloader 文件
单片机开发 step motor driver, very important c code.thanks.
step motor driver, very important c code.thanks.
Internet/网络编程 电力市场下确定无功源价值的方法探讨 因此提出了4种确定无功价值的方法:Vs法、PV曲线法、ERC法和Back.up法
电力市场下确定无功源价值的方法探讨
因此提出了4种确定无功价值的方法:Vs法、PV曲线法、ERC法和Back.up法,分析了不同方法
的特点,最后以IEEE30节点系统为例进行了仿真计算,仿真结果表明无功源的价值取决于电网的结
构、无功源的位置以及系统的运行状态。 ...
数据结构 void Knight(int i , int j) { // printf("%d %dn",i,j) if (board[i][j] != 0 || i < 0 || i >=
void Knight(int i , int j)
{
// printf("%d %dn",i,j)
if (board[i][j] != 0 || i < 0 || i >= Size || j < 0 || j >= Size )
{
return
}
step++
board[i][j]=step
if (step == Size*Size)
{
showboard()
system("PAUSE")
return
}
//DFS
Knight(i-2,j-1) //left
Knight(i-2,j+1)
Knight(i+2,j-1) //right ...
数据结构 算法设计的实验报告 包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现
算法设计的实验报告
包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、 ...
嵌入式/单片机编程 bootup code for Barebone, it s useful for bring up new chip
bootup code for Barebone, it s useful for bring up new chip
其他 Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than f
Input : A set S of planar points
Output : A convex hull for S
Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return.
Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR .
Step 3: Recursi ...