VC++和BC++数值分析类库2: <<VC++和BC++数值分析类库2>>一书的全部源代码。...

有关c语言程序设计的课件，希望有人喜欢！-The c language programming courseware, want someone to love!

< C++批判(第三版)>>,此书应该比较少见,值得珍藏-Cplusplus Criticize 3rd

RFID的基础知识的介绍，了解目前的主流RFID发展顺序-RFID introduction to the basics, understand the current development of the order of the mainstream RFID

This methodical text aspires to present various information relevant to operating systems, computer architecture, compilers, principles of programming languages, and C and C++ programming, specifically.

The objective of this page is to teach you how to use the Intel libraries to build applications where images or sequences of images have to be processed. In addition, the DirectShow technology is also introduced this one is particularly useful to process image sequences or sequences captures using PC cameras-The objective of this page is to teach you how to use the Intel libraries to build applications where images or sequences of images have to be processed. In addition, the DirectShow technology is also introduced this one is particularly useful to process image sequences or sequences captures using PC cameras

java编程思想,经典java入门教程！高手必备！-java programming ideas, classic java Tutorial! Master essential!

how to do programming in web development through java

讲述arcgis的基本应用及操作，适合初学者应用。-ARCGIS s using.

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.

jScript手册-JScript Manual