这是一个汇编程序

cuda Faster Matrix-Vector Multiplication on GeForce 8800GTX

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

Input method change demo

使用VC为编程语言，结合数据结构二叉树的概念，新编算法进行四分树的穷举。-VC to use programming language, combine the binary tree data structure concept, a new edition of the tree algorithm quarter of exhaustive.

字母表称为睫毛分离摩瑟

IC卡数据读写代码下载-IC card reader data downloaded code

基于C#的Winform程序，目前支持首页百度搜索资料，缓和圆曲线逐桩坐标计算，任意多边形面积计算，Cass坐标文件一键XY互换，3°带6°带坐标转换；支持一键强制关机，支持换肤。

串口通讯使用说明 在两台机器运行 但必须保证用串口线连接 -Serial communication for use in the two machines to run but must ensure that the serial cable connections

利用临界区的多线程同步测试-critical of the use of multithreading synchronous test

用VC编程实现迷宫游戏。调试环境：Win XP；VC++ 6.0-Programming with VC games maze. Debugging environment: Win XP VC++ 6.0