Search Results for "algorithm" - Page 4

NOTE: Project has been delayed due to other tasks. Genetic Algorithms General Solver (GAGENES) is a C++ implementation of the genetic algorithm concept.

Binary (hexadecimal) editor for Windows

FM-index is a compressed text index appeared in 2000 (http://pizzachili.dcc.uchile.cl/indexes/FM-indexV2/). A recent algorithm allows to update a FM-index (http://dx.doi.org/10.1016/j.jda.2009.02.007). Here, you'll find the implementation.

ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.

Collection of multi-platform C++ libraries

Foad is an open source software which receive an EKG Signal from scanner, WFDB database or heart sensors. Finding patient disease started by taking Fourier transform (FFT) from input signal and extract a single cycle. Based on some heuristic algorithm the most important feature like P , Q , R , S , T captured and feed to trained neural network. and so the final decision made by CNN library. As mentioned before this software also capable do some image processing on scanned paper to lower...

The package edmonds-alg contains a C++-implementation of Edmonds's optimum branching algorithm as described by Tarjan in 1977.

Evolutionary Structural Optimization Package (ESOP) consists of software for viewing, analyzing, and optimizing structures containing beam, truss, and membrane plate elements utilizing OpenGL and the Genetic Algorithm (GA). Created for use in M.S. theses

LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.

Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.

OptFlow is a C++ -based library for motion detection. It implements the classical Lucas-Kanade algorithm and a more advanced algorithm by Proesmans et.al. Several warping and morphing methods using the computed motion fields are also implemented.

An implementation of Bruhn et al.'s fast variational optical flow algorithm using the OpenCV image processing library. The code calculates dense flow fields with a user-specified level of precision.

This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.

Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys

In most cases,Developer required implementation library repeatedly for some modual.this project collection algorithm and implementation.Provide the necessary documentation.

The PowerCiph Data Encryption Algorithm is a versatile, yet simplistic, encryption algorithm/protocol. The ultimate goal of the algorithm is simplicity, compactness, and a lack of prerequisites.

A Multi-objective evolutionary algorithm library

Learn how to programm in c++ This project includes example Programms of Algorithm and Datastructure. Three students of Htwg Konstanz will release regularly example Programms in order that other people can learn c++. The first sources will be about search

It is the source code for a tree mining algorithm called TRIPS. It can mine frequent subtrees from a forest of tree structures.

MeMo (stands for Meta-Model) is planned as Generic Programming Language & IDE, as flexible & smart as it is possible for computer application, including adjustable syntax, algorithm reduction. Ideally, it has to contain AI for interacting with the user.

callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.

A concise example of the classical genetic algorithm, with a fancy windows terminal display. Features DNA editing, save/load, customizable constraints and statistics logging.

Library of terrain level of detail algorithm nodes for Coin (an implementation of an Open Inventor scene graph) and other utility classes. Currently are implemented ROAM, Geo Mip-Mapping and Chunked-LoD algorithms. Any issues and feedback for this projec

spGAL is a C++ Genetic Algorithm (GA) library. This is a portable scalable, and easy to use library written with ANSI C++.

ogx-rete implements the RETE algorithm in c++.