拱猪是一种很有趣的扑克牌游戏。即使你不知道它的玩法，你也可以由它的计分方式来了解它的趣味性。 假设在此我们仅考虑四个人的拱猪牌局，本题要求你根据下面的计分规则，...

这是关于压缩感知的OMP算法，代码不仅包含OMP算法，还包括测量数M与重构成功概率的关系和稀疏度K与重构成功率的关系。

这个是讲排序的东东,我也刚学习到的,共享给大家一起学-say this is the sort of Eastern, I have just learned that we shared together to learn

学习的时候写的一个打砖块的小练习，初学者代码可能不是很规范-When learning to write in a Arkanoid little practice, beginners may not be very standard code ....

一个vc开发的遗传优化―源代码-vc development of a genetic optimization-source

js的一个tooltip源码.用于提示信息-js source of a tooltip. For a message

实现方法: 用MFC的程序向导生成一个常规DLL,在常规DLL内有一派生自CWinApp的实例,再用MFC的程序向导生成一个MFC EXE应用程序,把MFC EXE应用程序中 CAppView,CMainFrame,CAppDocument的文挡和RES目录下的资源拷贝到常规DLL项目中,添加到项目中,编译生成一DLL,在另外一个WIN32应用程序中,启动一线程,在线程函数中显式装载该DLL,取的该DLL内的当前线程, CWinThread *pThread=GetCurrentThread() pThread->Run() 就可装载启动常规DLL内应用程序框架.-Realize Methods: The MFC AppWizard to generate a conventional DLL, in the conventional DLL there is one derived from CWinApp instance, reuse of the MFC AppWizard to generate a MFCEXE applications, the MFC EXE application CAppView, CMainFrame, CAppDocument block of text RES directory and copy resources to the conventional DLL project, add to the project, the compiler generates a DLL, in another WIN32 application, start a thread in the thread function explicitly loading the DLL, check inside the DLL the current thread, CWinThread* pThread = GetCurrentThread () pThread-

一个ping程序用来测试服务器的ping值，但是有点小问题：会跟系统的ping冲突，大家可以下载-Procedures used to test a ping server ping value, but a bit small problem: ping will conflict with the system, everyone can download

遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm is based on Darwin" s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combination optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.

normal distribution code for statistics

一个检测程序的部分-a part of the testing process