MATLAB dynamic simulation toolbox specific applications, is the realization of s...

Cult3D帮助文档_中文版-Cult3D help documentation _ the Chinese version

authorware制作的C语言课件，有助于大家通过实例学习authorware.-authorware courseware produced by C language to help everyone learn by example authorware.

vc动态链接库的开发与应用非常详细的描述全面剖析-vcusertodlldevelopmetprogrammer

JAVA文档,用于实现加密入门很有帮助,现在很多编程都需要有加密技术,以提高安全,这只是JAVA的学习书籍,希望对大家有帮助-Java documentation for entry to achieve encryption helpful, but a lot of programming needs to have encryption technology to enhance the security, which is learning Java books, we hope to help

think in java 第一版（中文）-think in the first edition (Chinese)

背包问题动态规划算法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.

java data object 作者： David Jordan, Craig Russe-java data object Author : David Jordan, Craig Russe

Please read your package and describe it at least 40 bytes in English.

The_C_Programming_Language__2nd_Edition Part 3

debian参考手册，linux系统debian发行版手册，基础操作-debian reference manual, linux system manual debian release, basic operation