使用MFC编写的画图

应用统计方法解决模式识别问题的困难之一是维数问题，低维特征空间的分类问题一般比高维空间分类问题简单。因此，人们力图将特征空间进行降维， 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

应用背景In generated networks, selecting one node as source and some nodes as receivers in random (single source multicast network), we make performance test for network coding based multicast route algorithm (we put forward it ourselves, corresponding to high multicast rate and low multicast rate), shortest path distribution tree route algorithm (DIJKSTRA algorithm) and Maximum-rate distribution tree route algorithm (PRIM algorithm), respectively. 关键技术 In this program, two things have been done: (1) generate random topologies (2)performance test。   network coding cap:     5.0000  dijk cap:     5.0000  prim cap:     5.0000  network coding res1:     0.0000--res2:    12.0000  dijk res:    14.0000  prim res:    14.0000  average degree:     2.

关于matlab编写的劳斯判据的算法，该算法包含完整的注释，根据自动控制原理当中的劳斯判据编写而来，可以对任意阶系统进行判稳

在分形几何里面，非常重要的一部分内容就是分形演化算法。这个模块提供的是用DLA模型模拟植物生长的算法。-Fractal geometry in the inside, a very important part of the content is the evolutionary algorithm fractal. The module is provided by DLA model simulation of plant growth algorithms.

资源描述Java 遗传算法 源代码  Java 遗传算法 源代码Java 遗传算法 源代码

分枝定界法，运筹学-branch-and-bound method, and operations

三色球问题 若有一个口袋放有12个球，其中有3个红的，3个白的和6个黑的，从中任取8个球， 问共 这也是一个可用穷举法求解的问题。 设任取的红球个数为i, 白球个数为 j，则黑球个数为8-i-j，用count统计不同的搭配数目- Three chromospheres questions if have a pocket to put have 12 balls, including 3 red, 3 white and 6 black, no matter what takes 8 balls, asked altogether this also is may use the question which the exhaustion method solves. Supposes no matter what takes the red ball integer is i, the white ball integer is j, then the black ball integer is 8-i-j, counts differently with count matches the number

uu encode and decode

一个B-树实现与编辑-a B-Tree and Editors

实现了一个链表的逆转,全部过程在一个链表内完成!-achieve a reversal of a linked list, in the entire process completed within a List!