代码搜索：Best 开发教程
找到约 10,000 项符合「Best 开发教程」的源代码
代码结果 10,000
www.eeworm.com/read/177981/9424916
m select6.m
function [out,coefs,pin,best,bestpin]=select6(chrom,d,x,y,s1,s2,s3,best,bestpin)
%
% out=select(in);
%
% selects a new population
%
%
%
% Mix up the population
%
chrom=shuffle(chrom);
%
www.eeworm.com/read/372113/9521342
m genetic_culling.m
function [patterns, targets, pattern_numbers] = genetic_culling(patterns, targets, params)
% Culling type genetic algorithm for feature selection
%
% Inputs:
% train_patterns - Input patterns
%
www.eeworm.com/read/169874/9835380
out art002.out
BEST NEURON:0
IN: 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
OUT: 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
Top Down weights:
1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
Bottom up weights:
0.200000 0.200000 0.200000 0.20000
www.eeworm.com/read/169874/9835383
out art001.out
BEST NEURON:0
IN: 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
OUT: 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
Top Down weights:
1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
Bottom up weights:
0.200000 0.200000 0.200000 0.20000
www.eeworm.com/read/362095/10019409
out art002.out
BEST NEURON:0
IN: 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
OUT: 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
Top Down weights:
1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
Bottom up weights:
0.200000 0.200000 0.200000 0.20000
www.eeworm.com/read/362095/10019415
out art001.out
BEST NEURON:0
IN: 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
OUT: 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
Top Down weights:
1 1 1 1 0 0 1 0 0 1 0 0 1 1 1
Bottom up weights:
0.200000 0.200000 0.200000 0.20000
www.eeworm.com/read/362008/10024006
m genetic_culling.m
function [patterns, targets, pattern_numbers] = genetic_culling(patterns, targets, params)
% Culling type genetic algorithm for pattern selection
%
% train_patterns - Input patterns
% train_targ
www.eeworm.com/read/360895/10072651
m trimmedmse.m
function [cost,retained] = trimmedmse(R,beta,V);
% Calculate trimmed mean of the squared value of the residuals.
%
% cost = trimmedmse(R);
%
% The factor where one trimms off the normed residuals is
www.eeworm.com/read/164272/10120050
m select6.m
function [out,coefs,pin,best,bestpin]=select6(chrom,d,x,y,s1,s2,s3,best,bestpin)
%
% out=select(in);
%
% selects a new population
%
%
%
% Mix up the population
%
chrom=shuffle(chrom);
%
www.eeworm.com/read/358750/10180506
cpp numtri.cpp
/*
ID: dd.ener1
PROG: numtri
LANG: C++
*/
#include
using namespace std;
//D[i,j]=max{D[i-1,j-1],D[i-1,j]}+S[i,j];
int main(){
long n;
ifstream cin("numtri.in");
cin>>n;
lon