蚂蚁算法

用MATLAB编写的运用Monte Carlo method数值积分的实例程序。可供初学者参考学习！-TETRAHEDRON_MONTE_CARLO is a MATLAB library which estimates the integral of a function over a tetrahedron using the Monte Carlo method. The library makes it relatively easy to compare different methods of producing sample points in the tetrahedron, and to vary the tetrahedron over which integration is carried out.

这个代码是有一个外国人写的，主要讲的是ukf的实现。#include #include #include "FreeRTOS.h" #include "kalman.h" #include "matrix.h" /*  * ukf_filter_new  */ ukf_filter ukf_filter_new(unsigned int state_dim,          

JAVA制作的fifa2004，可在手机上运行，模拟比赛双方的完整算法，真实还原比赛过程。

修改普通map，提升性能对于c++程序来说 map的使用无处不在。影响程序性能的瓶颈也往往是map的性能。尤其在大数据情况下，以及业务关联紧密而无法实现数据分发和并行处理的情况。map的性能就成了最关键的技术。比如：ip表、mac表，电话号码表、身份证号码表的查询、病毒木马的特征码的云查杀等等。stl库的map采用二分查找，性能最差。Google的哈希map性能和内存目前是最优的，但是有重复碰撞的机率。我在电信行业和信息安全行业里的工作经历发现，目前网络上的哈希算法都在查询速度上远远无法满足日趋增长的网络大数据要求。因此产生了自己写算法的想法。现在我把自己的算法发布出来。大家可以测试对比发现，我的算法属于零碰撞的几率，但是性能比哈希算法还优。声明：该代码不能用于商业用途，只能用于科学研究。

频繁项集挖掘采用spark实现的并行化挖掘算法（并行的apriori算法和b并行的  fp_growth算法）。并行的apriori算法采用scala编写，并行的fpgrowth采用java编写。里面会有较多函数使编程的内容。                                                                                                                                             &

给出一组数的全排列 如1,2,3给出 123,321,312-is a group of the whole arrangement is 123,321,312 as 1,2,3

A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists. -A program to find frequent itemsets (also c losed and maximal) with the eclat algorithm, which carries out a depth first search on the sub set lattice and determines the support of items ets by intersecting transaction lists.

基于蚁群算法的动态最优路径规划，信号处理，图像处理，程序源代码

计算圆覆盖率源程序，很精彩！-round coverage calculation source, wonderful!