类和数组

软件开发中很多时候会用到助记符，这个转换源码可以带替手工转换的麻烦。可以根据汉字自动转换，开发者可根据源码灵活运用。这是一个很实用的源码。

这是一个利用VC++编写的求解极值的多元的二次方程程序，在WindowsXP运行成功。-This is a VC solution prepared by the extreme diversity of the quadratic equation procedures, the successful running WindowsXP.

可以实现FFT算法原理,请关清高哦!!!sk sdfgarg-FFT algorithm can be achieved, please clearance GAO Oh!!! Sk sdfgarg

有关贝叶斯算法的java程序 优化计算和预测功能 比较好用-bayes arithmetic using java program

蚁群算法 (ACO) 是一种优化算法，利用蚂蚁物种的自然行为，蚂蚁觅食地上存款信息素。在这蚁群算法被介绍对付的图像边缘检测问题。提出基于蚁群算法的边缘检测方法是能够建立一个信息素矩阵表示提出了一种在图像每个像素位置的边缘信息根据大量的蚂蚁的运动有哪些派去在图像上移动。此外，运动这些蚂蚁是由图像的局部变化驱动强度值。实验结果进行了验证该方法的性能优越。

大家好！我在C ++初学者，以前从来没有编写任何其他语言。现在我想写将使用高斯约算法来找到n个未知数 的系统的解决方案，无需使用任何先进的概念，如类，重载运算符一个简单的控制台应用程序

主要分为3个函数。第一个函数为粒子群初始化函数 InitSwarm(SwarmSize......AdaptFunc)其主要作用是初始化粒子群的粒子，并设定粒子的速度、位置在一定的范围内。 -Mainly divided into three functions. The first function for the particle swarm initialization function InitSwarm (SwarmSize. ..... AdaptFunc) whose primary role is to initialize the particle swarm of particles, and set the speed of particles, location in a certain range.

OFELI is an object oriented library of C++ classes for development of finite element codes. Its main features are : * Various storage schemes of matrices (dense, sparse, skyline). * Direct methods of solution of linear systems of equations as well as various combinations of iterative solvers and preconditioners. * Shape functions of most "popular" finite elements * Element arrays of most popular problems (Heat Transfer, Fluid Flow, Solid Mechanics, Electromagnetics, ...).-OFELI is an object oriented library of C++ classes for development of finite element codes. Its main features are :* Various storage schemes of matrices (dense, sparse, skyline).* Direct methods of solution of linear systems of equations as well as various combinations of iterative solvers and preconditioners.* Shape functions of most "popular" finite elements* Element arrays of most popular problems (Heat Transfer, Fluid Flow, Solid Mechanics, Electromagnetics, ...).

辛普森复合算法 典型-Simpson typical composite algorithm

应用背景某个公司的面试题，贪吃蛇，用动态规划求解最佳路径。蛇从屏幕左端走到右边，经过格子可以得分，求最大得分关键技术动态规划，DP。一列一列的递归，右边一列的值取决于左边一列的值，从左到右最后获得全局解。