代码搜索：Lin
找到约 10,000 项符合「Lin」的源代码
代码结果 10,000
www.eeworm.com/read/374698/9388927
m lin_kernel.m
function x = lin_kernel(a,b,c)
% kernel function for implicit higher dimension mapping, based on
% the standard inner-product
%
% x = lin_kernel(a,b)
%
% 'a' can only contain one datapoint in a row,
www.eeworm.com/read/177981/9424475
m lin_seed.m
% 用线性模型设置种子群体
U_x='[ones( num_data,1) u1 ';
for i=2:num_inp,
U_x=[U_x 'u' num2str(i) ' '];
end
U_x=['U_data=' U_x '];'];
for k=num_inp:-1:1,
U_x = strrep(U_x,['u' num2str(k)],['u(1:num_da
www.eeworm.com/read/177981/9425074
m lin_seed.m
% Script file to seed the population of tree_ga with a linear model
%
% Author Date Predecessor Modification
% ====== ==== =========== ============
% B.McKay
www.eeworm.com/read/372883/9489073
tsp lin318.tsp
NAME: lin318
TYPE: TSP
COMMENT: 318-city problem (Lin/Kernighan)
DIMENSION: 318
EDGE_WEIGHT_TYPE: EUC_2D
NODE_COORD_SECTION
1 63 71
2 94 71
3 142 370
4 173 1276
5 205 1213
6 213 69
7 244 69
8 276 630
www.eeworm.com/read/371327/9556070
m lin_solve.m
function x = lin_solve(A,b)
[m,n] = size(A);
[R,v] = householder(A);
y = Qt_times_b(v,b,m);
x = R\y;
function [R,v] = householder(A)
[m,n] = size(A);
if m>n,
NumberOfReflections = n;
else
Nu
www.eeworm.com/read/169022/9885428
pdf lin_article.pdf
www.eeworm.com/read/361987/10024866
pdf cpp_lin.pdf
www.eeworm.com/read/166268/10026449
pdf cpp_lin.pdf
www.eeworm.com/read/360895/10072703
m lin_kernel.m
function x = lin_kernel(a,b,c)
% kernel function for implicit higher dimension mapping, based on
% the standard inner-product
%
% x = lin_kernel(a,b)
%
% 'a' can only contain one datapoint in a row,
www.eeworm.com/read/164272/10120255
m lin_seed.m
% Script file to seed the population of tree_ga with a linear model
%
% Author Date Predecessor Modification
% ====== ==== =========== ============
% B.McKay