Search Results for "engineering" - Page 6

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.

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

Discrete Mathematics task solutioner. (The Theory For Scheduling / Network Graphs) Contains C++ mathematic algorithms and C# GUI.

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

Este proyecto constituye una adaptacion y mejora del codigo ANFIS de dominio público de Roger Jang. / This project is an adaptation and improvement of the original public domain ANFIS code of Roger Jang.

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.

This project is goaled a r-language wrap of Artificial Neural Network library libfann. also known as R-binding libfann

OnuriS (Open soURce wImax Simulator) is a simulation platform designed for WiMAX in order to analyze network performances and develop particular allocators for better bandwidth allocation strategies that could greatly improve the overall system.

A univariate and multivariate analysis UI. This project is no longer under development. Please use as you wish.

Fuzzy numbers and basic fuzzy arithmetics (+, -, *, /, 1/x) implementation written in Java. Should be used as a library, but it also has a GUI which demonstrates its capabilities (using SWT widgets).

A java tool for anytime and interactive sequence mining. Aims at providing users with a way of analyzing her activity traces and extract activity schemes from them.

Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. JTLV is a new tool aimed to facilitate and provide a unified framework to the development of formal verification algorithms.

libgcs is a light-wight C/C++ programming library providing check sum calculations such as CRC.

This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.

The C++ library Geneva allows to run large scale parametric optimization problems. It can run in serial or multi-threaded mode or in a networked environment. The library currently covers Evolutionary Strategies, Genetic Algorithms and mixed scenarios.

LR(k) parser generator (k>=0) implementation.

EasyGenetic is a highly efficient C++ framework for genetic master-slave algorithms. It heavily makes use of template metaprogramming to provide a fully customizable environment that accommodates most of user's needs without sacrificing efficiency.

A cross-platform library that computes fast and accurate SIFT image features. libsiftfast provides Octave/Matlab scripts, a command line interface, and a python interface (siftfastpy). Optimized with SIMD instructions and OpenMP .

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

Multiclass machine learning

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.

An implementation of LAYAGEN G(Diego-Mas 2010) for solves the layout planning problem using a simple genetic algorithm, and fully written in GAMBAS

Graphserver provides fast shortest-path computations on very large graphs, for use as a sub-component of a trip-planning service.

CILib is a framework for developing Computational Intelligence software in swarm intelligence, evolutionary computing, neural networks, artificial immune systems, fuzzy logic and robotics.