卡耐基课程SSD1实践要求源代码完成的鲶鱼…

打开IE 浏览器，调用 m_pWebBrowser2 类实现-Open the IE browser, called m_pWebBrowser2 class to achieve

适合新手学习的标准粒子滤波。快速入门。matlab上m语句编程实现。希望可以帮助到大家。该算法适合非线性非高斯系统。具有很广的使用范围。

QT贪吃蛇完整版（源代码+EXE），图形界面，带积分榜，难度等级分为5级，源代码完整，在XP系统下，qt-win-opensource-4.8.3-mingw + qt-creator-opensource-windows3.2-x86 + MinGW-gcc440_1 环境下编译通过.

大名鼎鼎的SM501 2D显卡驱动， 系列源码文件，包括各种流行的处理器平台。 XScale SH4 AU1500 X86 从 WinCE 4.2-6.0 还有WindowsXP Embedded X86的。-Famous SM501 2D graphics-driven, family-source documents, including a variety of popular processor platforms. XScale SH4 AU1500 X86 from WinCE 4.2-6.0 there is a WindowsXP Embedded X86.

VC技术内幕配套源代码（ 第6章),我已经调试好过的-technology supporting source code (Chapter 6), I have a better debugging

此例子虽然小,但是确实我的一位同学提出的,呵呵,当然她不是学计算机的,还着实让我想了一阵子.不要嫌弃简单,你会吗? 用vb调用excel,excel做数据库,可不是access啊.-small, but actually one of my classmates made, Oh, of course she is not a computer, but also did so for a while I think. Despise not simple, you would call it using vb excel, excel do database access is not ah.

编程实现最大子段和问题的求解（分别采用分治法和动态规划法求解）。-Programming the largest sub-segment and the problem solving (respectively divide and conquer and dynamic programming method to solve).

c#使用XML保存程序配置参数的例子，vs2005下CE5.0程序。-c# use XML to preserve examples of procedures for configuration parameters, vs2005 procedures under CE5.0.

mediaplayer测试程序，对初学者非常有用，可以做为程序使用。-mediaplayer testing procedures, very useful for beginners, you can use as a procedure.

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the