Search Results for "algorithms" - Page 10

>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> pack:tag is now available at github: https://github.com/galan/packtag >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>

Based on the introduction of Genetic Algorithms in the excellent book "Collective Intelligence" I have put together some python classes to extend the original concepts.

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

A base set of libraries. Boilerplate type code and algorithms. Currently skuttil (Java util & parsing code) and searKit (generic Java search framework).

This is a tidy lightweight library implementing a series of C++ Design Patterns, aiming to be simple, clean and portable. This library is made to help C++ programmers to develop projects with clearer and more compact source code.

Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.

Interface to deal with graphs ( Adjacency list representation ) written in C... Only basic operations available now, soon to be more =) Small project to college, not much implemented yet...

The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.

A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.

Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.

ngram is a module to compute the similarity between two strings. It is different to python's "difflib.SequenceMatcher" in that it cares more about the size of both strings. ngram is an port and extension of the perl module called "String::Trigram

XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.

The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc

Codefactor utilities: ReflectionThread, ObjectParser

API Java de visualisation et d'interaction dans le domaine des graphes.

Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.

Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.

TypeRecognizer is C++ class which enables the developer to recognize data types in compile-time

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.

NT2 is a multi-platform C++ library providing various template matrix classes that can be used with a Matlab(tm) like syntax whose performances are close to those obtained with hand written C code. NT2 comes with various numerical toolboxes.

Generic System for Data Processing

plausj a collection of checksum algorithms used to validate business keys like bank account codes or credit card numbers. It's compiled as JVM bytecode files (although it's not necessarily implemented in Java) and can be used on JRE 1.5 and later.

LazyEngine is a collection of Tools for PHP, C# and JavaScript (based on JQuery). The goal is to have a Library that contains most common functions daily used by software developers.

A general purpose and measurement conversion library in Pascal.

The project is created with an aim to provide - design patterns implemented in C++ using boost. Following are the primary requirements 1) Generic Header Only Library 2) Using Boost Libraries, Coding Style, Philosophy 3) Standard C++