DownloadszIBMLPICtec.rar

一个很游泳的标准啊，值得一看啊-a swimming standards ah, ah eye-catcher

VCL图标组件,TChar的经典教程-icon VCL components of the classic guide TChar

线程池的实现代码-The realization of the thread pool code

很好的c语言教程- Very good c language course

串口通讯大权，介绍了RS232，RS422，RS485等串行通讯的协议，规范，具体说明等。帮助你写好串口同学-Serial communication power, introduced the RS232, RS422, RS485 and other serial communication protocol, standardization, and specific descriptions. Students help you write the serial

用MATLAB设计滤波器实例，包括FIR、IIR等-Filter design with MATLAB examples, including FIR, IIR, etc.

对。网屏中文参考公司。同志们准备好了吗？

wince 嵌入式的首选，新技术，请到家快来看看。-embedded wince preferred, new technologies, go to Come and take a look at home.

ArCView的学习文件，用于ArcView的学习，非常有用的-ArcView study documents, for ArcView learning, very useful

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