n皇后问题，亦是经典算法与分析题目，通过回溯的方法，解决此问题...

哲学家就餐问题的两种算法实现-Two philosophers eat algorithm

内含一个高斯随机数的发生程序，实现语言为C＋＋，对某些工程人员可能会有用。-containing a Gaussian random occurrence of procedures to achieve language C++, some staff may be used.

本程序为生成给定分布律的随机数 模拟规划 也是图论中经典得程序 -This procedure for generating a given distribution law of random numbers simulation planning is a classic graph theory procedures

poj 1699的代码和方法说明,个人原创 -the codes and solution for poj 1699

根据已知数据的权重对数据进行拟合，若不能给出数据的权重就默认为数据权重为1.这种拟合 方法是根据最小二乘进行的。-The basis of known data on the weight of the data fitting, if the data should not give the weight for data on the default weight is 1. This method is based on least-squares fitting carried out.

用C++完成的双链表源代码-completion of the C-List source code

CKNN  Using the Citation KNN algorithm[1] to get the labels for bags in testBags, where minmum Hausdorff distance is used to measure the distances between bags %     CKNN takes, %        PBags     - an Mx1 cell array where the jth instance of ith positive bag is stored in PBags{i}(j,:) %        NBags     - an Nx1 cell array where the jth instance of ith negative bag is stored in NBags{i}(j,:) %        testBags  - a Kx1 cell array where the jth instance of ith test bag is stored in testBags{i}(j,:) %         Refs     - the number of referecnes for each test bag %        Citers    - the number of citers for each test bag %      &n

在 NS 2.35 启动 tcl 代码简单启动。你可以轻松学会它的形式如何 tcl 文件中的代码。什么会的参数。值。只是用户友好的代码。

Gryphon is a Java-based computational fluid dynamics code written to solve the quasi 1-D Euler equations.

快速幂级2 跟前面的是一起的-rapid power level with the previous two are together