贝叶斯分类

哲学家就餐问题源代码-dining philosophers problem source code

简单的机器人避障算法，使用的是虚拟力场的方法。附有效果截图。对于机器人路径规划的初学者会有帮助。代码简单易懂，可以自己设定障碍物的位置。

C语言数据结构作业三元组序列表，特点是非零元在表中按行序有序储存，因此便于进行依行顺序处理的矩阵运算，然而若需按行号存取某一行的非零元，则需从头开始进行查找-C language data structures operating sequence in Table 3, which is characterized by non-zero yuan in the table in an orderly sequence by storage firms, according to facilitate order processing line matrix calculation, but by businesses that require access to a line of non-zero yuan, then you start from scratch

模拟植物生长算法的分形树源程序，根据迭代次数的不同获得一株完整的植物生长图，对其具体的参数进行修改可以做一些人工智能方面的优化

分布性一致性算法的Isabella验证 we introduce a novel Broadcast-Free Algorithm that solves Consensusproblem in the presence of a Weak-Fairness property and an unreliablefailure detector -property, in asynchronous distributed systems, and later itsformal verication. The Broadcast-Free Algorithm Model is dened as a globaltransition system that is unambigously generated by local transition rules. At thesystem run, the algorithm model attempts involves two concepts : one to systemrun represents a innite computation and one to asynchronous communicationbetween processes without Broadcast.

求函数极小值，适用于不带约束的、函数可以为非线性的无约束规划问题的求解-Demand function is minimum applicable to non-binding, the function can be non-binding for the non-linear programming problem solving

资源描述 这个是一个非常好的代码，踏实一个好的程序aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

最优化算法，包括各种线性优化和非线性优化问题-Optimization algorithms, including linear optimization and nonlinear optimization problems

ZUC是一个面向字的流密码。它需要一个128位的初始密钥和一个128位的初始矢量（IV）作为输入，输出一串32位字的密钥流（因此，这里每一个32位的字称为密钥字）。密钥流可以用来加密/解密。 IV初始化，也就是，时钟控制着密码运行但不产生输出。第二阶段是工作阶段，在这个阶段，随着每一个时钟脉冲，它都会产生一个

维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码