代码搜索：solving
找到约 630 项符合「solving」的源代码
代码结果 630
www.eeworm.com/read/450938/7474390
svn-base est_q_bilinear.m.svn-base
% Finds the approximate bilinear projective model parameters (q) between
% two images, g and h, by solving eq. 19 in Mann and Picard.
%
% Model: u = q1xy + q2x + q3y + q4
% v = q5xy + q
www.eeworm.com/read/450938/7474403
m est_q_bilinear.m
% Finds the approximate bilinear projective model parameters (q) between
% two images, g and h, by solving eq. 19 in Mann and Picard.
%
% Model: u = q1xy + q2x + q3y + q4
% v = q5xy + q
www.eeworm.com/read/440814/7680588
m sa_tsp.m
%this program is written by 刘学智. Finished time is 05.1.23 16:03
%utilizing it solving TSP problem by simulating stealing algorithm
[fval,route]=sa_tsp(d,10,0.1,.87)
d=[0 2 1 2 0 0 1 0 1 2 1 1 1 1
www.eeworm.com/read/479175/6700336
m rkldg_o3.m
%RKLDG with order 3 in both time and space,for solving Ut=Uxx,with U(x,0)=sin(x),basis bases on the legendre polynomials
for k=1:4
Nx=20*(2^(k-1))
dx=2*pi/Nx;dt=0.0016/(2^(2*k-2));T=2;Nt=T/
www.eeworm.com/read/476981/6743723
frm frmnn.frm
VERSION 5.00
Object = "{F9043C88-F6F2-101A-A3C9-08002B2F49FB}#1.2#0"; "COMDLG32.OCX"
Begin VB.Form frmUSR
Caption = "Solving XOR problem using neural networks"
ClientHeight =
www.eeworm.com/read/128468/14295493
m ka.m
function [Alpha, bias, margin, t, flps] = ka(X,I,ker,arg,C,tmax,epsilon,Ni,mi)
% KA kernel-Adatron algorithm solving SVM (L1) problem.
% [Alpha,bias,margin,t,flps]=ka(X,I,ker,arg,C,tmax,epsilon,Ni,mi)
www.eeworm.com/read/430506/1929454
m ka.m
function [Alpha, bias, margin, t, flps] = ka(X,I,ker,arg,C,tmax,epsilon,Ni,mi)
% KA kernel-Adatron algorithm solving SVM (L1) problem.
% [Alpha,bias,margin,t,flps]=ka(X,I,ker,arg,C,tmax,epsilon,Ni,mi)
www.eeworm.com/read/373460/2761888
m ka.m
function [Alpha, bias, margin, t, flps] = ka(X,I,ker,arg,C,tmax,epsilon,Ni,mi)
% KA kernel-Adatron algorithm solving SVM (L1) problem.
% [Alpha,bias,margin,t,flps]=ka(X,I,ker,arg,C,tmax,epsilon,Ni,mi)
www.eeworm.com/read/364151/2908058
svn-base est_q_bilinear.m.svn-base
% Finds the approximate bilinear projective model parameters (q) between
% two images, g and h, by solving eq. 19 in Mann and Picard.
%
% Model: u = q1xy + q2x + q3y + q4
% v = q5xy + q
www.eeworm.com/read/367442/9747981
m ka.m
function [Alpha, bias, margin, t, flps] = ka(X,I,ker,arg,C,tmax,epsilon,Ni,mi)
% KA kernel-Adatron algorithm solving SVM (L1) problem.
% [Alpha,bias,margin,t,flps]=ka(X,I,ker,arg,C,tmax,epsilon,Ni,mi)