Based on M/G/K multi

本书由刘汝佳、黄亮编著，由清华大学出版社出版。本书较为系统和全面地介绍了算法学最基本的知识。这些知识和技巧既是高等院校“算法与数据结构”课程的主要内容，也是国际青少年信息学奥林匹克（IOI）竞赛和ACM/ICPC国际大学生程序设计竞赛中所需要的。书中分析了相当数量的问题。本书共3章。第1章介绍算法与数据结构；第2章介绍数学知识和方法；第3章介绍计算机几何。全书内容丰富，分析透彻，启发性强，既适合读者自学，也适合于课堂讲授。 本书适用于各个层次的信息学爱好者、参赛选手、辅导老师和高等院校计算机专业的师生。本书既是信息学入门和提高的好帮手，也是一本内容丰富、新颖的资料集。。

he 8-puzzle will be represented by a 3x3 list of lists positions where the empty box will be represented by the value 9, as shown below: [[9,1,3],[5,2,6],[4,7,8]] Possibility Solution: Only half of the initial positions of the 8-puzzle are solvable. There is a formula that allows to know from the beginning if you can solve the puzzle.To determine whether an 8-puzzle is solvable, for each square containing a value N is calculated how many numbers less than N there after the current cell. For example, to the initial status

分支定界的0/1背包问题-branch delimitation of the 0/1 knapsack problem

微粒群寻优算法源程序,可根据需要自行修改-Particle swarm optimization algorithm source code can be modified according to the needs of their own

贝叶斯bayes算法分类器诊断程序-Bayesian classifier diagnostic procedures

Householder法求解最小二乘问题。可以避免常规方法遇到奇异矩阵(即行列式|A|接近零)时误差太大的问题。本方法的精度非常高。-Householder method least squares problems. Avoid conventional methods encountered singular matrix (that is determinant | A | close to zero) error much of a problem. The accuracy of this method is very high.

简单的马尔科夫算法，Markov链数据提供了有当前状态决定，而又独立于当前状态的序列，此处算法是将给定的文本串生成新的随机文本- Simple Sample of a Markov Chain Algorithm：A markov chain is a sequence of random variables in which the future variable is determined by the present variable but is independent of the way in which the present state arose from its predecessors. The code is a simple example of a markov chain that generates somewhat random text output from a given text input.

此代码是LZW的算法实现，对学习LZW算法有一定的帮助，有兴趣的朋友可以下载来看看，值得学习！

资源描述一个不错的LZW压缩文件算法示例代码，才用VC6.0写的，可以编译通过，压缩效率还不错，我测试过简单的位图比gif/png等格式压缩效率都要高！！！

这是我下的fortran的文件，大家多多交流，呵呵，不是垃圾-the FORTRAN documents, we interact more, huh, not rubbish