代码搜索：Gradient
找到约 2,951 项符合「Gradient」的源代码
代码结果 2,951
www.eeworm.com/read/439580/7705566
java gradient1.java
import java.awt.*;
import java.awt.geom.*;
public class Gradient1 extends Frame{
Paint gPaint1, gPaint2, gPaint3, gPaint4;
public Gradient1(String title){
super(title);
gPaint1=n
www.eeworm.com/read/438912/7720467
png 14_gradient.png
www.eeworm.com/read/438117/7736127
php jpgraph_gradient.php
www.eeworm.com/read/399996/7816831
m gradient_descent.m
function Min = gradient_descent(a, theta, eta, fun)
% Minimize a function using the basic gradient descent algorithm
%
% Inputs:
% a - Initial search point
% theta - Convergence criterion
%
www.eeworm.com/read/397362/8054602
m rbf_gradient.m
% 2.基于梯度法的RBF 网设计算法
SamNum = 100; % 训练样本数
TargetSamNum = 101; % 测试样本数
InDim = 1; % 样本输入维数
UnitNum = 10; % 隐节点数
MaxEpoch = 5000; % 最大训练次数
E0 = 0.9; % 目标误差
% 根据目标函数获得样本输入输出
rand('state',sum(10
www.eeworm.com/read/397099/8068862
m gradient_descent.m
function Min = gradient_descent(a, theta, eta, fun)
% Minimize a function using the basic gradient descent algorithm
%
% Inputs:
% a - Initial search point
% theta - Convergence criterion
%
www.eeworm.com/read/245941/12770935
m gradient_descent.m
function Min = gradient_descent(a, theta, eta, fun)
% Minimize a function using the basic gradient descent algorithm
%
% Inputs:
% a - Initial search point
% theta - Convergence criterion
%
www.eeworm.com/read/330850/12864960
m gradient_descent.m
function Min = gradient_descent(a, theta, eta, fun)
% Minimize a function using the basic gradient descent algorithm
%
% Inputs:
% a - Initial search point
% theta - Convergence criterion
www.eeworm.com/read/328518/13023388
class painter$gradient.class
www.eeworm.com/read/317622/13500883
m gradient_descent.m
function Min = gradient_descent(a, theta, eta, fun)
% Minimize a function using the basic gradient descent algorithm
%
% Inputs:
% a - Initial search point
% theta - Convergence criterion