是一个在EVC下开发的闹钟定制程序。其中一个难点就是如何创建、写、读一个ini 文件。由于是在EVC下，所以很多API函数都不被支持比如关于.ini文件读写Ge...

数据矩阵解码器，实现了多为条形码的解读，输入条形图片即可解析条形码的信息-Data matrix decoder to achieve a number of bar code reading

舍入误差与有效数C源代码-rounding error and the effective number of C source code

说明游戏的文本文件大家快来去下栽吧！我是个新手-Note the game Come to the U.S. text file下栽吧! I am a novice

制作Windows CE上安装程序的模板-Template for making CE installing shield in windows

Capture the statemnet of device, such as CPU, RAM, HD, Network, and etc.

对投影的曲线算法-right curve projection algorithm

WMA_encoder/WMA解码器详解-WMA_encoder

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

.NET PetShop购物程序_学习专用-. NET PetShop _ learning dedicated to procedures

目前，人工智能及其火爆，这个程序是基本的神经网络架构，适合刚刚入门的同学，而且是在tf架构搭建，tf是目前非常热门的神经网络平台。