基于最大类间方差阈值与遗传算法的道路分割算法

c语言数值计算算法，包括各种排序算法、差值、迭代等-c language numerical algorithms, including sorting algorithm, the margin, such as iterative

源程序实现的是基于卡尔曼滤波的车辆检测与跟踪，并对车辆进行计数编号。-Source implementation is based on Kalman filtering vehicle detection and tracking, and count the number of vehicles.

此程序在 c + + 实现了数独。GUI 被实现的 qt 离散度。你可以充分的你所需的数据的单元格中履行这种游戏，和该程序可以检查你是否正确。您可以在 visual studio 2008 中运行该程序，你应该在你的机器上安装 qt 离散度。

应用背景 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS"" AND  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF  * SUCH DAMAGE.关键技术 * Redistribution and use in source

一个关于数据挖掘的决策树算法-a data mining on the Decision Tree Algorithm

Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces. This code implements a basic multi-objective optimization algorithm based on Diferential Evolution (DE) algorithm. When one objective is optimized, the standard DE runs; if two or more objectives are optimized, the greedy selection step in DE algorithm is performed using a dominance relation.

BST树是一种二叉查找树，但是若是多次插入，BST树便会失衡或者退化成链。于是在BST树的基础上又附加了一个堆的性质，本程序采用最小堆原则。程序代码使用的是VB6.0编写，由于VB中没有指针，所有本程序采用数组模拟，程序一方面实现了treap的算法，另一方面也加了可视化操作界面，非常直观。

k均值聚类分析，比较简单，只适合学习使用个，不适合数据处理。-k-means clustering analysis, relatively simple, only suitable for learning to use one, not suitable for data processing.

最优化算法，包括各种线性优化和非线性优化问题-Optimization algorithms, including linear optimization and nonlinear optimization problems

每次抛骰子时都会出现不同的点数，连续抛n次骰子时，出现点数和概率最大的计算方式