代码搜索：Beta值
找到约 10,000 项符合「Beta值」的源代码
代码结果 10,000
www.eeworm.com/read/129427/14243240
txt 权值保存.txt
输入层与隐层之间的矩阵
0.952598 0.566786 0.448113 -0.442259 0.857045
0.152708 -0.450046 -1.004866 -0.640977 -0.144963
-0.653810 0.970209 -0.113135 -0.745494 -0.979935
-0.229629 0.
www.eeworm.com/read/229945/14311022
m neville插值.m
%Neville插值法
function y=Neville(x1,y1,x)
m=length(x);
n=length(x1);
for k=1:m
for i=2:n
for j=2:i
y1(i,j)=((x(k)-x1(i))*y1(i-1,j-1)-(x(k)-x1(i-j+1))*y1(i,j-1))/(x1(i-j+1)-x1(i));
www.eeworm.com/read/229945/14311056
m newton插值.m
%Newton插值法
function y=Newton(x1,y1,x);
m=length(x);
n=length(x1);
for i=2:n
for j=n:-1:i
y1(j)=(y1(j)-y1(j-1))/(x1(j)-x1(j-i+1));
end
end
for j=1:m
p(j)=y1(1);
for k
www.eeworm.com/read/229509/14333604
doc 保护定值.doc
www.eeworm.com/read/125071/14514829
c 插值法.c
www.eeworm.com/read/117716/14907598
cpp 计算最优值.cpp
#include
#include"make2db.h"
int r[7]={0,10,5,1,10,2,10};
int **kay,**c;
int C(int i,int j)
{ //返回c(i,j) 并计算kay(i,j)=kay[i][j]
//避免重复计算
//检查是否已计算过
if(c[i][j]>0) return c[i][j]
www.eeworm.com/read/218222/14930813
txt 传递结构值.txt
#include
struct Person
{
char name[20];
unsigned long id;
float salary;
};
void Print(Person &pr)
{
cout
www.eeworm.com/read/701/1938