此程序为硬件EDA编程，实现了十位的计数器功能，在平台中可以模块化应用...

c++ 实例教程123，学习c++的不错的例程，相信对于初学者和高级编程者都有好处的-Guide to 123 c example, the study c good routines, and I believe beginners and advanced programmers are beneficial

使用多线程控制多辆小车，可进行速度与车辆数的设置，模拟小车在物流园区内的运行，从而检验运输效率。线程代表小车

灰度扩展及灰度图像伪彩色化：灰度值在0～20之间显蓝色，20～40之间显绿色，40～255显红色。 -Gray-scale images of pseudo-color: gray-scale value between 0 to 20 Hin blue, between 20 to 40 green, 40 ~ 255 marked in red.

IPC空链接测试代码，可以测试你想测试的的ip是否可以建立空链接！-IPC air link test code, you can test you want to test the ip of the possibility of establishing air links!

8数码问题的C语言版本 可以借鉴 希望有帮助-8 digital issues of the C language version can draw hope to have help

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

一个模仿windows的计算器。 只包含普通型计算器。未包含科学性-A mimic windows calculator. Contains only general-type calculator. Does not contain scientific

用JAVA，开发的一个LCD液晶时钟-with Java, the development of an LCD clock

windows ce 下的自制播放器，能播放mp3，mp4，-windows ce made under the player, can play mp3, mp4,

windows XP的发展与简介，为了解XP的发展提供详尽的-windows XP development and profiles, to understand the development of XP to provide detailed