顺序的Gauss消去法

matlab程序实现 最短路径问题 最短路径问题是图论研究中的一个经典算法问题， 旨在寻找图（由结点和路径组成的）中两结点之间的最短路径-matlab program to achieve the shortest path problem shortest path problem is the study of graph theory, a classical algorithm for the problem, aimed at finding a plan (by the node and path composed of) two nodes of the shortest path between

The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated . The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction.-The Molgedey and Schuster decorrelation algorithm, having square mixing matrix and no noise . Truncation is used for the time shifted matrix, and it is forced to be symmetric . The delay Tau is estimated . The number of independent components are calculated using Bayes Information Criterion (BIC), with PCA for dimension reduction.

《超长整数运算的计算机实现》论文文档-"long integer computation computer" paper documents

1.1 基于交互输入的义原查询、义原距离计算、义原相似度计算1.2 基于交互输入的词语义项查询、义项相似度计算、词语相似度计算；1.3 基于文件输入的词语义项查询、词语相似度计算；1.4 相似度计算中的参数调整。  

随机数生成程序- Random number production procedure

简单的adaboost程序，面临着MIT库，利用Haar特征进行训练

简要的Gauss列主元消去法，很实用，用matlab实现，还有一个图例，程序说明很详细-brief Gauss main-element elimination, very practical, using Matlab to achieve, there is a legend, a very detailed description of the procedures

很全的数据结构源代码，线性表、树、图的代码都有具体实现。以及字符串的各种操作

应用背景aplikasi神经网络，为工作上syaraf tiruan数据网。关键技术计算机智能化，penalaran电脑，komputasi，INI tugas matakuliah

在人工智能计算机科学领域，遗传算法（GA）是一种启发式搜索，模仿自然选择的过程。此启发式（有时也被称为元启发式）常规地用于产生有用的解决方案，以优化和搜索问题。遗传算法属于较大的类进化算法（EA），其产生的解决方案，以优化利用技术，灵感来自自然进化，如继承，变异，选择和交叉的问题。