用c#语言进行的天气识别系统，里面有四叉树算法，有一些网格优化算法导航．...

是关于XML的基础读物,编制的很好,是入门的很好读物,完全可以快速上手-On the basis of XML books, prepared well, is a good entry-books can be quickly started

是一本学习对数学模型进行离散化、算法化和程序化的电子书。-Is a study of the mathematical model discretization, algorithms and procedures of the e-book.

-Gege研究指出，这项研究是Struts的第一步

win32系统编程3，内容有点深 johnson M.Hart著-3, as a little deep with johnson M. Hart

VC6从入门到精通 VC6从入门到精通-VC6 proficient VC6 from entry to entry to the master from VC6 from entry to the master

directshow的权威说明资料,是大家学习directshow的必备书籍-directshow the authority descriptive information We are learning the essential books directshow

我自己编写的关于神经网络滤波的程序-I have written on the neural network filtering procedures

中文开发手册，SPRING.pdf。pdf版本 -Chinese development manual, SPRING.pdf

麦田里的守望者 读过的最有感觉的书之一-Catcher in the Rye is the most read book one feeling

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.