从太平洋电脑上下载然后制作的CHM格式的MFC的专题讲座

介绍了单天线GPS姿态定位，希望对大家有帮助-Introduce a single-antenna GPS attitude positioning, in the hope that everyone has to help

微软北大讲座电子文档-Beijing talks electronic files

西门子数控编程手册，查询方便，好用，希望大家喜欢。-siemens_mill.chm

Protege新手入门-推理篇,非常适合初学者使用，有具体的例子一步一步进行引导。-Protege novice Getting Started- reasoning, articles, very suitable for beginners, there are specific examples step by step guide.

Visual Basic.NET控件时尚编程百例-Visual Basic.NET fashion programming controls 100 cases

面向软件工程的Visual C++网络程序开发-Oriented software engineering, Visual C++ Network program development

VC编写USB 协议 中文 很好 不错-usb protocole en chinois dans vc plus

MIT关于从事AI研究的学生的一些工作的建议和指导。相当不错，对于从事其他领域的研究工作的人也有指导作用 -MIT AI engaged in research on the students of the work of recommendations and guidance. Quite well, and all those involved in other areas of research work is also instructive role

linux

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