代码搜索结果

function ll = loglikelihood(theta, patterns, h, center_point, cp_target) % Used by the polynomial fitting algorithm [c,r] = size(patterns); patterns = center_point * ones(1,r) - patterns;

#include #include using namespace std; int a[31],b[31]; void main() { int n; cin>>n; for(int i=1;i>a[i]; b[1]=a[1]>0?a[1]:0;//b[i]用以纪录以a[i]为最后元素的最

% By Youhanna Parvizinejad (83405169) and Mahdi Farahmadfar (81414271) % ------------------- Valid Range Of Algorithm ------------------- Start_points=[-4 -1.5]; End_points=[2 1]; %---------

% By Youhanna Parvizinejad (83405169) and Mahdi Farahmadfar (81414271) % ------------------- Valid Range Of Algorithm ------------------- Start_points=[-4 -1.5]; End_points=[2 1]; %----------- B

% By Youhanna Parvizinejad (83405169) and Mahdi Farahmadfar (81414271) % ------------------- Valid Range Of Algorithm ------------------- Start_points=[-4 -1.5]; End_points=[2 1]; %----------- B

% HMM's % HMM_Backward - HMM backward algorithm % HMM_Boltzmann - Find the transition matrices of an HMM using Boltzmann networks % HMM_Decoding - Find probable states fro

function T = prune_tree_C45(T,A,B,CF) % PRUNE_TREE_C45 prunes the decision tree T using the pruning algorithm from % C4.5: Programs from Machine Learning. % % T = prune_tree_C45(T,A,B,CF) % % T

#include #include #include #include using namespace std; //PKU 2249 组合数(不预处理) int main() { __int64 n,k,ans,i; scanf("%I64d %I64d",&n,&k); while

---------------------------------------------------------------------- Genetic Algorithm Toolbox for MATLAB, v1.2 ========================================== Thank you for requesting a copy of t

/* modexp.h handle the Modexp calculation ((a^p)%m) using Montgomery algorithm (O(logn)) */ #ifndef _MODEXP_H #define _MODEXP_H #define BIGINT unsigned long long BIGINT modexp(BIG