关于游戏开发的杂志，希望能对喜欢游戏开发的人士起到帮助作用。...

Navida之CUDA学习入门资料。对初学者有用！-Navida introductory information on the CUDA learning. Be useful for beginners!

verilog ieee standard 2001

暂时没有源码,先传些书籍再说.- Temporarily does not have the active code, first passes on books to say again

Thinking in c++ 2,非常好的学习c++的书,希望对你有用-Thinking in c++ 2

HSDPA 、UMTS－－移动通信的高速无线访问。-John.Wiley.and.Sons. HSDPA.HSUPA.for.UMTS. High Speed Radio Access for Mobile Communications

华为编程规范，酷！-Huawei programming norms, cool!

mfc编程讲解，从mfc最基础讲起，适合于初学mfc者-mfc programming on from talking about the most basic mfc, mfc those suitable for beginner

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

德仪官方网站上的msp430系列的详细介绍，msp430开发者必备。-Official website of Texas Instruments MSP430 series of detailed introduction, msp430 developers must.

第一本中文版,值得一读-first of the Chinese version, it is worth a read