搜索资源列表
wugui
- 三维无规行走，能走得个方向概率相同 回避所有经过的路线-three-dimensional random walk, can go the same direction to avoid all probability after the line
RaoBlackwellisedParticleFilteringforDynamicBayesia
- The software implements particle filtering and Rao Blackwellised particle filtering for conditionally Gaussian Models. The RB algorithm can be interpreted as an efficient stochastic mixture of Kalman filters. The software also includes efficient stat
On-Line_MCMC_Bayesian_Model_Selection
- This demo nstrates how to use the sequential Monte Carlo 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 a
Reversible_Jump_MCMC_Bayesian_Model_Selection
- This demo nstrates the use of the reversible jump MCMC algorithm for neural networks. It uses a hierarchical full Bayesian model for neural networks. This model treats the model dimension (number of neurons), model parameters, regularisation paramete
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
FitPlane
- 采用最小二乘的方法，根据平面的坐标方程，拟合出空间平面的方程的各个系数，如有疑问请上： buaagc.blog.163.com-Using least squares method, according to the coordinates of plane equation, fitting two-dimensional space of all coefficient equation, If you have any questions, go to buaagc.blog.163.
path_search
- 俄罗斯套娃游戏，给定一个输入矩阵，每个点权值不同，从起始点出发怎样走才能获得最大收益，每个点只能走到比当前点权值大的点，即能套住当前点，类似于俄罗斯套娃。-Russian Doll game, given an input matrix, each point with different weights, starting from the starting point for how to go to gain maximum benefit from every point only to
K-mean
- K均值算法： 给定类的个数K，将N个对象分到K个类中去， 使得类内对象之间的相似性最大，而类之间的相似性最小-K-means algorithm: the number of a given type of K, will be assigned to N objects of category K go, making the object category similarity between the largest, while the category of the simi
pio-fortran
- 伯肃叶流动用格子boltzmann方法去扩展新的研究方法-Peter Stephen leaf lattice boltzmann method flow go with the expansion of new research methods
GA
- 遺傳演算法(Genetic Algorithm),使用c++編譯，有需要者拿回去參考吧！-Genetic algorithm (Genetic Algorithm), using c++ compiler, there is a need to go back and refer to those who get it!
GA(java)
- 遺傳演算法(Genetic Algorithm),使用java編譯，有需要者拿回去參考吧！-Genetic algorithm (Genetic Algorithm), using the java compiler, there is a need to go back and refer to those who get it!
OTHERS
- 包含一些大眾化的數學題目，比如說buffon丟針問題、dijkstra的三色旗問題、找零錢問題、背包問題、無限位數的整數運算、最短路徑問題-Contains a number of popular topics in mathematics, for example, lost buffon needle problem, dijkstra the tri-color flag in trouble, go to change the problem, knapsack problem, inf
jiaoben
- 一个完整的脚本演示，包含源码，以及演示包，想学的去看看吧-Demonstration of a complete scr ipt, including source code, as well as the presentation package, I would like to go and see to learn
FFT
- for fast fourier transform inprtant program kindly go through it hope you wil be benifitted by the program uploded here
shuta1
- 算法分析经典的数塔问题，从顶部出发，在每一结点可以选择向左走或是向右走，一起走到底层，要求找出一条路径，使路径上的值最大。 -Algorithm analyzes a number of classic tower problem, starting from the top, at each node can choose to go left or right, go, walk out together to the ground floor, asked to find a pat
lvxingshangwenti
- 旅行商问题，即TSP问题（Traveling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 TSP问题是一个组合优化问题。该问题可以被证明具有NPC计算复杂性。因此，任何能使该问题的求解得以简化的方法，都将受到高度的评价和关注。 -Traveling salesman problem, the T
ChessDisplay
- VC++马走日棋盘搜索算法源码举例，运行时候电脑比较慢，运行完毕显示结果，可以以动画演示或直接显示棋盘的方式显示结果-VC++ horse to go on board search algorithm Source For instance, when the computer is running slow, run the finished result will be displayed, can be animated presentations or direct way to di
FiveDirectionPad_Algo
- 此作業需使用Backtracking algorithm 從第一格開始，從1到9依序測試是否可以填入，若本來此格已有數字，則直接往下一格走。若可以填入( if(promising()) )則填入該數字並且往下一格移動繼續填，若此格沒有可填入的數字時，則結束該格的動作，回到上一格去測試剩下的可能結果。若已經填完( if(solution is found) )，則可能解+1，然後回到前面再繼續尋找接下來的可能解。直到全部可能的數字組合都試完之後，程式結束，所有可能解的個數也會被找到。需要印出的
shuzhi_6
- 方法一Gauss消去法 采用一般Gauss消去法解方程组 方法二：列主元Gauss消去法 先找出没一步中没列的主元然后应用Gauss消去法解方程组 -A Gauss elimination method Gauss elimination method using the general method of solving system of equations II: main-element Gauss elimination method did not find som
code
- 天马行空（马走日字不重复地走完整张N*N棋盘）求解算法-This is the algorithm which can let the horse go all over the chess board without repeating.