oreilly

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.

网络编程用书--《点对点短消息网间互通协议要求V3.0》，pdf文件-network programming books-- "short message point-to-point network interoperability requirements in the agreement between V3.0," pdf documents

给出求解线性多目标规划问题弱有效解子集的一种新算法．在不同的条件下，运用此　 算法得到了线性多目标规划的弱有效解子集，并在得到的解子集中再次进行寻优，进而得到　 弱有效解集中决策者满意的较优解；同时用ＶＣ＋＋语言实现了此算法，并给出了具体算例． -Given for solving linear multiobjective programming weakly efficient solution of a subset of the new algorithm. Under different conditions, using this algorithm is a linear multi-objective planning for a subset of weakly efficient solution, and in the solution subset of re-optimization, and then weakly efficient solution to be satisfied with the focus on decision-makers better solution at the same time using VC language realize this algorithm, and gives a specific example.

ArcGIS Engine ControlsCommands CSharp的一个例子-ArcGIS Engine of a ControlsCommands CSharp examples

VHDL多媒体式教学资料（aldec公司)-VHDL teaching multimedia information (aldec company )...............

莱昂氏UNIX源代码分析莱昂氏UNIX源代码分析- The Leon UNIX source code analyzes the Leon UNIX source code to analyze

编写动态链接库,在其中编写函数,实现相关功能,然后创建mfc程序进行调用.-The preparation of a dynamic link library, in which the preparation of function, the realization of related functions, and then create a mfc procedure call.

《J2ME与游戏开发》-"J2ME and game developers"

支持向量机ppt MIT.pdf，由麻省理工学院老师主讲的教材-SVM ppt MIT.pdf, from the Massachusetts Institute of Technology conducted the teachers teaching

opencv-IPL-IPP-SDK之间的比较，介绍等，适用于视觉初级用户-opencv-IPL-IPP-SDK comparisons between introduction and so on, apply to the visual primary users