Go to 跳转到指定的帧

数据结构图的建立和使用 包挂路径查询-map data structure, the establishment and use of packet path linking inquiries, etc.

数据结构与算法-程序、素材STL向量测试类-Data Structures and Algorithms- procedures, materials testing STL Vector Class

用三种不同的方式在矩形材料内切出指定半径大小的圆的算法，本来是建模实习的作业题-Three different ways in the rectangular-cut material the size of the specified radius of a circle algorithm, it is modeling the operation of internship title

一个随机数生成类，值得下载--An random class,recommend

获取主机mac地址vc程序，程序简洁，方法简单-Access to the host mac address vc procedures, the procedures simple, method is simple

VB6中用DataReport做报表 -used VB6 statements do DATAREPORT

TCL语言学习的几个小程序，非常简单，学习tcl的例子。-TCL language learning process several small, very simple, learning peers example.

基于导频的传统的OFDM系统的信道估计源程序 [scme-2006-08-30.zip] - 3gpp信道模型代码,加入mimo,-Based on the traditional pilot channel estimation in OFDM system, source [scme-2006-08-30.zip]- 3gpp channel model code, adding mimo,

实现GridView中的数据转换成EXCEL中，基于EXCEL模板-Achieve the GridView in the data into EXCEL, the template based on EXCEL

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