这是关于成功的业务标准

数值分析实验题目牛顿迭代法求根 这个也是计算方法中的常用计算程序 学过的人都知道的-topic Newton iterative method for solving this calculation method is commonly used in the calculation procedures learned in the people know that the

本文档详细的介绍了在windowsce下的编程方法以及示例。对学习CE的人有帮助。-this document described in detail in the windowsce programming methods and examples. On learning of CE help.

多元树的层次遍历、先根遍历、后根遍历 问题的描述： 函数填空：层次遍历多元树（在文件tree.cpp中3个空）、先根遍历、后根遍历的递归函数（在文件tree.h中2个空）； 多元树的输入：在主程序中调用多元树的函数（定位根、找大儿子、找下一个兄弟等），输入某棵多元树。 -Multi-level tree traversal, the first traversal the root, root traversal issues Description: function to fill in the blank: multi-level tree traversal (tree.cpp in the document in three space), the first traversal the root, root ergodic recursive function (in the document in two empty tree.h) multiple input tree: In the main program to call multi-tree function (positioning root, look for the eldest son, to find a brother, etc.), enter a multi-tree tree.

many implementing them, created using opencv, "Artificial Vision"

c++计算器头文件Windows中老的版本没有这个头文件-c++ calculator header files in older versions of Windows do not have this header file

对图像去噪使用统计筛选器的代码。请尽你所能描述您的项目中的详细信息。更好的内容将会为您获得更多积分)

一个VB写的反汇编工具,完整无插件,是学习反汇编的好资料,在VB6.0下就可以运行,请放心下载,xp下运行通过了,反汇编出来的代码很不错.-VB to write an anti-compilation tools, integrity and non-plug-in, is to learn from a good anti-compiled data, can run under VB6.0, Please be assured download, xp running under adopted, anti-compiled code out is pretty good.

rm的开发包，在网上找的。对想转码RM的有帮助-rm

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

这是遗传算法学习 codei 已取得解释为几乎 everyline 的代码。它具有结构简单的 SGAhowever 它面临着一个单一的极值问题，你可能会改变一些参数甚至算法，使它成功解决多价问题