代码搜索:solving

找到约 630 项符合「solving」的源代码

代码结果 630
www.eeworm.com/read/467198/7020088

m mlpdm1.m

function [W1, W2, RMSE] = mlpdm1(trn_data, mlp_config, train_opt, disp_opt) % MLPDM1 Demo of solving 1-input 1-output problem using MLP with % hyperbolic tangent activation. % % See also TANMLP1,
www.eeworm.com/read/467198/7020189

m mlpdm1b.m

function [W1, W2, RMSE] = mlpdm1(trn_data, mlp_config, train_opt, disp_opt) % MLPDM1 Demo of solving 1-input 1-output problem using MLP with % hyperbolic tangent activation. % % See also TANMLP1,
www.eeworm.com/read/143498/12870556

m mlpdm1.m

function [W1, W2, RMSE] = mlpdm1(trn_data, mlp_config, train_opt, disp_opt) % MLPDM1 Demo of solving 1-input 1-output problem using MLP with % hyperbolic tangent activation. % % See also TANMLP1,
www.eeworm.com/read/143498/12870786

m mlpdm1b.m

function [W1, W2, RMSE] = mlpdm1(trn_data, mlp_config, train_opt, disp_opt) % MLPDM1 Demo of solving 1-input 1-output problem using MLP with % hyperbolic tangent activation. % % See also TANMLP1,
www.eeworm.com/read/300074/13939415

txt sa解tsp.txt

%使用模拟退火算法解决TSP问题的matlab通用源程序 %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 %2 0 1 4 1 0 1
www.eeworm.com/read/424747/10418047

m ga2.m

% Genetic algorithm for solving simple optimization problem % f(x1,x2)=(4-2.1*x1^2+x1^4/3)*x1^2+x1*x2+(-4+4*x2^2)*x2^2, -3≤x1≤3,-2≤x2≤2 %The stategy of optimal maintaince is applied in the algorith
www.eeworm.com/read/318884/13467907

m geneticalgorithm.m

% Genetic algorithm for solving simple optimization problem % f(x1,x2)=(4-2.1*x1^2+x1^4/3)*x1^2+x1*x2+(-4+4*x2^2)*x2^2, -3≤x1≤3, % -2≤x2≤2 %The stategy of optimal maintaince is applied in the algo
www.eeworm.com/read/393832/8260836

m sa_tsp.m

%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 %2 0 1 4 1 0 1 1 1 3 1 0 2 1 %1 1 0 1 0 0 0 3 1 1 0 2 2 1 %2
www.eeworm.com/read/334702/12580450

m geneticalgorithm.m

% Genetic algorithm for solving simple optimization problem % f(x1,x2)=(4-2.1*x1^2+x1^4/3)*x1^2+x1*x2+(-4+4*x2^2)*x2^2, -3≤x1≤3, % -2≤x2≤2 %The stategy of optimal maintaince is applied in the algo
www.eeworm.com/read/146775/12613452

m geneticalgorithm.m

% Genetic algorithm for solving simple optimization problem % f(x1,x2)=(4-2.1*x1^2+x1^4/3)*x1^2+x1*x2+(-4+4*x2^2)*x2^2, -3≤x1≤3, % -2≤x2≤2 %The stategy of optimal maintaince is applied in the algo