winmain封装

libsqlora8-2[1].2.10.tar.gz

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

该系统具有良好的用户友好性

在手机上选择上网的方式，根据自己和网络的要求选择-choices in phone access to the Internet, according to its own requirements and the choice of network

this to capture ip packet-this is to capture ip packet

一个游戏修改器源代码-a game for source code changes

json解析器,对json格式的进行解析,windows VC编译-json parser for json format parsing, windows VC compiler

这是我平时无聊写着玩的用于图像的绘制，有椭圆和矩形，应用于WINDOWS界面。-This is my usual boring play written for image mapping, oval and rectangular, use Windows interface.

Quantization of a image. This algorith show the type of quantization employed and the result of image quantization.

Bruno Luong All rights reserved