-
himself wrote a dynamic priority scheduling process procedures is limited, but c...
这是自己写的一个动态优先级进程调度程序,水平有限,不过绝对能运行,希望管理员能让我加如这个集体,我想飞-himself wrote a dynamic priority scheduling process procedures is limited, but certainly can run, I hope that administrators can increase as a collective, I almost lost
- 2023-04-05 02:55:03下载
- 积分:1
-
A standard windows ce programs, large majority of ce procedure standard framewor...
一个标准的windows ce 程序,大大多数ce程序的标准框架,很值得学习。-A standard windows ce programs, large majority of ce procedure standard framework, it is worth learning.
- 2022-09-12 03:20:04下载
- 积分:1
-
ADSL 自动拨号投票
实现 ADSL 自动拨号,断线,指定网站进行投票.delphi7开发。所有资源都在压缩包中。
- 2023-04-14 20:25:03下载
- 积分:1
-
这种程序实在是简单得不能再简单,网上随处可见,不过我既然写了一个,也放上来吧,附上源码。使用方法请查看压缩包中的Readme文件。...
这种程序实在是简单得不能再简单,网上随处可见,不过我既然写了一个,也放上来吧,附上源码。使用方法请查看压缩包中的Readme文件。 -this procedure is utterly simple, Internet can be seen everywhere, but since I was an also Fangshanglai bar, accompanied source. Please see use of compressed readme file.
- 2023-08-22 17:40:03下载
- 积分:1
-
将英文大写字母转换成小写字母,中文汉字不变。
将英文大写字母转换成小写字母,中文汉字不变。-convert the capital letter into lowercase letter and the chinese mustn t be changed
- 2022-11-06 03:45:04下载
- 积分:1
-
diblok想象处理!
Diblok for imagine processing!
- 2022-03-06 18:20:35下载
- 积分: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
-
外国人搞的,非常神奇的机器码!如此小的程序能产生效果如此好的3D动画,见识见识吧!运行方式在文件中有...
外国人搞的,非常神奇的机器码!如此小的程序能产生效果如此好的3D动画,见识见识吧!运行方式在文件中有-foreigners engaging and very magical binary! Such a small procedure would produce results so good 3D animation, insight insights! Operation is in the document
- 2022-06-28 13:20:44下载
- 积分:1
-
Visual C++ MFC 入门教程,我觉得还可以
Visual C++ MFC 入门教程,我觉得还可以-MFC Visual C Directory entry, I felt that I could
- 2022-06-18 11:45:49下载
- 积分:1
-
ch2_mousecapture_programming_mfc_prosise
以下是Jeff Prosise编写的第2版“使用MFC编程Windows”第2章的源代码。这里的源代码附带了一个完整的visualstudio构建。
- 2022-03-16 14:57:11下载
- 积分:1