这是一篇讲解蚂蚁算法的文章。我看到上载分类里有文章、书籍类别，并不仅限于源代码，就上载了这个文章，格式为PDF文件。我读过，很好。是英文的。...

RedHat认证资料-RedHat authentication information

Java Version 3.5编程指南.Doc-Java Programming Guide Version 3.5. Doc

介绍3dmax的书籍，从头开始，讲的比较详细，值得一看-introduced 3dmax books, and start from scratch, say in greater detail, an eye-catcher

VB示例程序，函数Asc、AscW-VB sample programs, function Asc, AscW

WFMC工作流标准的接口23的中文版，你可以结合其他几个标准文档一起学习WMFC。-redundant work flow standard interface 23 of the Chinese version, you can combine several other standard file WMFC learning together.

基于内容的图像检索技术，一本很经典的图像检索书。-base on image content detect

JAVA上加密算法的实现用例，可以作为加密的入门手册-JAVA encryption algorithm on the realization of use cases can be used as an encrypted entry manual

C Traps and Pitfalls. c陷阱与缺陷. 比较适合想深入了解c,并有足够编程经验的人学习-C Traps and Pitfalls. C traps and defects. More appropriate to think in depth understanding of c, and have sufficient experience to learn programming

数字逻辑与数字集成电路（第2版），经典中的经典，使学习数字逻辑和数字集成电路的必备书籍。欢迎下载-Digital Logic and Digital Integrated Circuits (2nd edition), the classic of the classics, and make learning digital logic and digital integrated circuits essential books. Welcome to download

A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。 公式表示为： f(n)=g(n)+h(n), 其中f(n) 是节点n从初始点到目标点的估价函数， g(n) 是在状态空间中从初始节点到n节点的实际代价， h(n)是从n到目标节点最佳路径的估计代价。 -A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path.