-
JSP Network Application Guide 2003 16
JSP网络应用教程2003 16-JSP Network Application Guide 2003 16
- 2023-01-26 16:15:09下载
- 积分：1
-
绣花机信息处理模式的研究与实现
绣花机花样信息处理的研究与实现的一篇pdf文档-Embroidery machine pattern of information processing research and implementation
- 2022-01-22 05:02:31下载
- 积分：1
-
a sample StdAfx.h which includes the XTToolKit.h file using MFC extenson.
a sample StdAfx.h which includes the XTToolKit.h file using MFC extenson.
- 2022-09-09 14:45:02下载
- 积分：1
-
1.The content is too simple
2.Is not a sourcecode or document
3.lost some...
1.The content is too simple
2.Is not a sourcecode or document
3.lost some files
4.Description is not detailed or not correct
5.Compressed file has password
6.Sourcecode duplicate or already exist
- 2022-03-12 21:47:04下载
- 积分：1
-
搜索引擎的技术信息，是一个比较全面的专业（他们…
搜索引擎方面的技术资料,是一个比较完整的专业(主题)搜索引擎的设计。-search engines technical information, is a more comprehensive professional (theme) search engine design.
- 2022-05-29 13:35:29下载
- 积分：1
-
Programming Embedded Systems
Programming Embedded Systems
- 2022-05-04 22:39:15下载
- 积分：1
-
EMC Test of information Beijing Jiaotong University
ＥＭＣ测试方面的资料北京交通大学－－沙斐编写的-EMC Test of information Beijing Jiaotong University- Shafi
- 2022-08-17 12:21:18下载
- 积分：1
-
清华大学博士生前沿课 移动通信最新发展
清华信息科学技术国家实验室 王京...
清华大学博士生前沿课 移动通信最新发展
清华信息科学技术国家实验室 王京-Tsinghua University doctoral student class cutting-edge mobile communications information on the latest developments in science and technology of Tsinghua National Laboratory, WANG Jing
- 2022-02-02 09:13:05下载
- 积分：1
-
背包问题动态规划算法JAVA
给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价...
背包问题动态规划算法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.
- 2023-04-22 23:20:03下载
- 积分：1
-
printf
printf -printf ccccccccccccccccccc
- 2023-04-04 18:00:03下载
- 积分：1
