-
孙鑫老师的VC++的第13课时的源程序。可以自由下
孙鑫老师的VC++的第13课时的源程序。可以自由下-SUN Xin teachers VC++ The first 13 hours of the source. Free under
- 2022-02-05 04:43:15下载
- 积分:1
-
主要封装了CNdkIOCPServer,CNDKThreadServer,CNdkTcpClient 三个类及相关的连接池,线程池等,大家看看,有意 见的话给我...
主要封装了CNdkIOCPServer,CNDKThreadServer,CNdkTcpClient 三个类及相关的连接池,线程池等,大家看看,有意 见的话给我提提 starcbh@21cn.com NdkIOCPServer类需win2k以上 必须winsock2.2以上版本 ============================================ // NdkIOCPServer.h: interface for the CNdkIOCPServer class.-CNdkIOCPServer the main package, CNDKThreadServer, CNdkTcpClient three categories and the associated link pool, thread pool, you see, there are views to the starcbh@21cn.com NdkIOCPServer I mention category above must be win2k winsock2.2 versions ======= ==================================// NdkIOCPServer.h : CNdkIOCPServer interface for the class.
- 2022-07-19 09:48:47下载
- 积分:1
-
制作分形图形的软件,很好用
制作分形图形的软件,很好用-producing fractal graphics software, is useful
- 2023-06-04 13:00:04下载
- 积分:1
-
6000元的视频聊天软件
6000元的视频聊天软件 -dsssssssssssssssssssssssssssssssssssss
- 2023-08-10 18:35:04下载
- 积分:1
-
打开对话框中选多文件
打开对话框中选多文件-more open dialog selected documents
- 2022-03-02 06:18:20下载
- 积分:1
-
一简单带文字的进度条
喜欢的朋友下载
更上一层楼
一简单带文字的进度条
喜欢的朋友下载
更上一层楼-One simple language with the progress bar like a friend to download a higher level
- 2023-03-26 06:20:03下载
- 积分:1
-
1背包问题是NP难题。0
0-l背包问题是子集选取问题。一般情况下,0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时,只要其左儿子结点是一个可行结点,搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和;cp是当前价值;bestp是当前最优价值。当cp+r≤bestp时,可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序,然后 依次装入物品,直至装不下时,再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right
- 2022-03-25 00:00:51下载
- 积分:1
-
This procedure is used to staff the curriculum with lessons and inquiries produc...
本程序是用于教职员课程安排与带课查询所制作的,适合各类学校使用。VB6.0+Access开发-This procedure is used to staff the curriculum with lessons and inquiries produced, suitable for all types of schools. VB6.0+ Access Development
- 2022-03-26 12:02:29下载
- 积分:1
-
数据挖掘领域经典:数据挖掘中10个最挑战的问题
数据挖掘领域经典:数据挖掘中10个最挑战的问题-Classic areas of data mining: data mining 10 most challenging problems
- 2022-10-21 18:05:04下载
- 积分:1
-
金山词霸组件屏幕取词源码
资源描述金山词霸组件屏幕取词源码。C#源码,可用,XP,win7都能运行。
- 2023-01-08 08:55:03下载
- 积分:1