A collection of multi-dimensional data indexing algorithm. It implements the following data structure: * Range Tree * Priority Search Tree * Segment Tree (in progress) * Flat Segment Tree This project has just been conceived. There is a lot to be done to bring it to a level of u...

[http://go-oo.org http://scsolver.googlegroups.com/web/go-oo.png] Linear and non-linear optimization solvers designed for OpenOffice.org Calc. = Introduction = The goal of this project is to develop a Calc add-on component that solves a constrained linear or non-linear programming model for ...

= EPITA's Algorithmic Language Interpreter = The EPITA's algorithmic language is educational programming language derived from Pascal using french keywords and providing the full set of expected features of a programming language (functions, procedures, pointers, array, records ... ) While ori...

This is a Java implementation of the LoFIA algorithm. Based on the compact data structure FP-tree in FP-growth algorithm, LoFIA is proposed to employ bottom-up and depth-first approach to quickly identify the longest frequent schemas from dense data. It is worth noting that support (frequency...

Multiobjective Ant Colony System substructure Discovery algorithm's code, data and scripts. Main developpers: Rocio: http://decsai.ugr.es/ Arnaud: http://www.softcomputing.es/

Source Code of Introduction to Algorithms(2nd Edtion) Created at June 22,2008 ==TDACA== C++ Code of _The_ _Design_ _and_ _Analysis_ _of_ _Computer_ _Algorithms_ _(Chinese Version)_ http://intro2algorithms.googlecode.com/svn/branches/TDACA

==Spring IoC based framework for complex data analysis with OpenCL computing.==

We want to build a library including source codes from different online judge websites. We think that a collection of on-line source code would help us learn algorithm better.

Introduction to algorithms (2nd edition) by Cormen, Leiserson, Rivest, Stein code in C#. Attempt to translate all pseudo-code from the book to C#.

some complicated algorithm demo using javascript on web ,it's fun and easy to learn if you wish .