代码搜索：Problem

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

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/415313/11076420

m demkmn1.m

%DEMKMEAN Demonstrate simple clustering model trained with K-means. % % Description % The problem consists of data in a two-dimensional space. The data is % drawn from three spherical Gaussian distri
·
www.eeworm.com/read/415313/11076514

m demknn1.m

%DEMKNN1 Demonstrate nearest neighbour classifier. % % Description % The problem consists of data in a two-dimensional space. The data is % drawn from three spherical Gaussian distributions with prio
·
www.eeworm.com/read/415313/11076698

m demmlp2.m

%DEMMLP2 Demonstrate simple classification using a multi-layer perceptron % % Description % The problem consists of input data in two dimensions drawn from a % mixture of three Gaussians: two of which
·
www.eeworm.com/read/413912/11137135

m demhmc1.m

%DEMHMC1 Demonstrate Hybrid Monte Carlo sampling on mixture of two Gaussians. % % Description % The problem consists of generating data from a mixture of two % Gaussians in two dimensions using a hybr
·
www.eeworm.com/read/413912/11137140

m demkmn1.m

%DEMKMEAN Demonstrate simple clustering model trained with K-means. % % Description % The problem consists of data in a two-dimensional space. The data is % drawn from three spherical Gaussian distri
·
www.eeworm.com/read/413912/11137222

m demknn1.m

%DEMKNN1 Demonstrate nearest neighbour classifier. % % Description % The problem consists of data in a two-dimensional space. The data is % drawn from three spherical Gaussian distributions with prio
·
www.eeworm.com/read/413912/11137398

m demmlp2.m

%DEMMLP2 Demonstrate simple classification using a multi-layer perceptron % % Description % The problem consists of input data in two dimensions drawn from a % mixture of three Gaussians: two of which
·
www.eeworm.com/read/266537/11220121

c arbitrage.c

/* University of Ulm Programming Contest 1996 Problem A: Arbitrage Implementation: Mark Dettinger */ #include #include #define max(a,b) ((a)>(b)?(a):(b)) main() { FILE*
·
www.eeworm.com/read/266537/11220125

c eenymeeny.c

/* University of Ulm Programming Contest 1996 Problem E: Eeny Meeny Moo Implementation: Mark Dettinger */ #include int n; /* number of cities */ int next[200]; /* ring for
·
www.eeworm.com/read/266537/11220236

c tree.c

/* Contest : Ulm Local Contest 1997 * Problem H : Tree Recovery * Method : Recursive Descent * Author : Mark Dettinger * Date : June 13, 1997 */ #include #include
·