Go To English Version 超过100万源码资源,1000万源码文件免费下载
  • TFTPUtil_Source_Version_1.3.0.zip ... https://cvn.sourceforge.net/cvnroot/tftputil To Do (in no order): Add multicast option support Add documentation Get everything to compile in Mono Add option to not change source port Have option to run as a services Show number of resent blocks
  • CFFeatureSample.rar [CFFeatureSample]Speaking of the amount of the number of plug-in
  • quasi.rar 伪随机数生成器,Implementation of the Quasi-Random Number generator currently hardwired to no more than 52 dimensions
  • number.rar 阿拉伯数字手写体的识别源码 vc++能够编译运行
  • matlabmatrix.rar ... input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should ... output: Enter k>0: 100 144 is the smallest fibonacci number greater than or equal to 100. It is the 12th fibonacci ...
  • On-Line_MCMC_Bayesian_Model_Selection.rar ... algorithm with reversible jump MCMC steps to perform model selection in neural networks. We treat both the model dimension (number of neurons) and model parameters as unknowns. The derivation and details are presented in: Christophe Andrieu, Nando de ...
  • Reversible_Jump_MCMC_Bayesian_Model_Selection.rar ... neural networks. It uses a hierarchical full Bayesian model for neural networks. This model treats the model dimension (number of neurons), model parameters, regularisation parameters and noise parameters as random variables that need to be estimated. ...
  • Prime_test.rar Test your system performance. From finding the Prime number.
  • 2262.rar ... 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. ...
  • 2309.rar ... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries ...