这是一部关于计算机专业毕业论文的电子书籍

Linux目录解释，详细介绍LINUX文件目录-Linux Directory to explain in detail the LINUX file directory

包含了几种经典算法的有关程序及其部分注释-includes several classical algorithm for the procedure and some of Notes

高性能的oracle 9i 和10g 的调整,很有参考价值，我找了好久，这是第一部分-high-performance oracle 9i and 10g adjustment of great reference value, I find myself, This is the first part

王小平版《遗传算法－理论、应用与软件实现》遗传算法的光盘源代码-Wang Xiaoping version of "genetic algorithm-Theory, Application and Software" genetic algorithm source code CD

delphi6函数大全-Delphi6 function Daquan

SQL的入门资料，供大伙很好的入门学习与积累-Introductory information on SQL for everyone a good entry-learning and the accumulation of

内容包括: 打开一个文件用于读或写,分析文件名,使用快速排序例程进行排序,向正在执行的程序发送一个信号,改变数据段空间位置,非局部转移,以指定频率打开PC扬声器 ,正切函数,转换一个无符号长整型数为字符串,送格式化输出到一流中 ,返回窗口内水平光标位置等 -include : open a file for reading or writing, analysis, and the use of rapid sorting routines for sorting, being implemented to send a signal change of location data, non- partial transfer, open to the designated frequency PC speakers tangent function, converting an unsigned long integer to a string, send formatted output to a first-class, the window to return to the level of the cursor position

传说梦里花落知多少就是抄袭这本书的- In the fable dream the flower falls knows how many is plagiarizes this book

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.

文件包括《面向MATLAB工具箱的人工神经网络理论与应用实例》一书中的所有源程序，并附有程序清单。-documents include "Toolbox for MATLAB Artificial Neural Network Theory and Application", a book of all the source, together with a list.