代码搜索:Algorithm

找到约 10,000 项符合「Algorithm」的源代码

代码结果 10,000
www.eeworm.com/read/137209/13340162

html gaotindex.html

Genetic Algorithm Optimization Toolbox (GAOT) The following files are in the distribution: Main interface ga.m
www.eeworm.com/read/137170/13341633

h tea.h

// The TEA encryption algorithm was invented by // David Wheeler & Roger Needham at Cambridge // University Computer Lab // http://www.cl.cam.ac.uk/ftp/papers/djw-rmn/djw-rmn-tea.html (1994) /
www.eeworm.com/read/322539/13377288

3 gsm_opti.3

.\" .\" Copyright 1992-1995 by Jutta Degener and Carsten Bormann, Technische .\" Universitaet Berlin. See the accompanying file "COPYRIGHT" for .\" details. THERE IS ABSOLUTELY NO WARRANTY FOR THIS
www.eeworm.com/read/320625/13421247

html ibg2.html

IBG 2.0 - grid generation algorithm grid generation algorithm The points obtained by the octree algorithm are used as input for the Delaunay algorithm. This results
www.eeworm.com/read/317622/13500874

m contents.m

% 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
www.eeworm.com/read/316641/13519596

h md5.h

//MD5.h #ifndef __MD5_H__ #define __MD5_H__ #include "MessageDigest.h" //Typical DISCLAIMER: //The code in this project is Copyright (C) 2003 by George Anescu. You have the right to //us
www.eeworm.com/read/316604/13520451

m contents.m

% 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
www.eeworm.com/read/313228/13591755

html 12-01.html

www.eeworm.com/read/312163/13617307

pl references.pl

{ "Anderson62" =>"T.W.Anderson and R.R.Bahadur. Classification into two multivariate normal distributions with differrentia covariance matrices. Anals of Mathematical Statistics, 33:420--431, Ju
www.eeworm.com/read/310735/13644823

m lsvmk.m

function [iter, optCond, time, u] = ... lsvmk(KM,D,nu,tol,maxIter,alpha); % LSVMK Langrangian Support Vector Machine algorithm % LSVMK solves a support vector machine problem using an iterati