张西安

背包问题动态规划算法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写的功能简单的始终，运用到了多线程的机制-A function written in java is always simple, the use of the multi-threading mechanism

一批VC的源码合集，拥有相当多实用的代码-number of VC source Collection, with a considerable number of practical code

徐士良 《C常用算法程序集》第2版 第4部分 -"C algorithms procedures set" second edition, Part 4

VB指令函数集 -VB Function Set Directive Directive Function Set

介绍VC++ MFC的中英文对照文章，希望对大家能有所帮助-Introduction VC++ MFC bilingual article, in the hope that everyone can be helped

C++的复杂性只是一个必要条件，并非问题的根本症结。根本症结在于人的心理，每个人都喜欢戴着脚镣跳舞，并且以为是“创新”。意识到这一点之后可以帮我们避免被各种各样名目繁多的语言细节和技巧占去不必要的时间。-c++study

IEEE 802.16-2004 (802.16REVd) IEEE 802.16-2005 (802.16e) Intel’s Whitepapers, 2004 (http://www.intel.com/technology/itj/2004/volume08issue03/) “IEEE Standard 802.16: A Technical Overview of the WirelessMAN Air Interface for Broadband Wireless Access,” C. Eklund et al., IEEE Communication Magazine, June 2002 “Broadband Wireless Access with 802.16/WiMax: Current Performance Benchmarks and Future Potential,” A. Ghosh et al., IEEE Communication Magazine, Feb 2005 “Wireless Communication Standards: A Study of IEEE 802.11, 802.15, and 802.16,” T. Cooklev, 2004

gradute student paper for student to help them -graduate studnet paper

Effective C++中文版.rar-Effective C++ Chinese version. Rar