Open Source Linux Algorithms

An open source software-defined Global Navigation Satellite Systems (GNSS) receiver written in C++ and based on the GNU Radio framework.

C++, Matlab and Python library for Hidden-state Conditional Random Fields. Implements 3 algorithms: LDCRF, HCRF and CRF. For Windows and Linux, 32- and 64-bits. Optimized for multi-threading. Works with sparse or dense input features.

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

Syntactic is a simple C++ library for constructing general Neural networks. For now the library supports creation of multi layered networks for the Feedforward Backpropagation algorithm as well as Time Series Networks. More will be implemented soon.

Simple POSIX multithread Ant Colony Optimizer framework currently for solving Vehicle Routing Problem. Supports UDP, file synchronizatoin between computers.

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.

Arageli is a C++ library for computations in arithmetic, algebra, geometry, linear and integer linear programming. Arageli provides routines and classes that support precise, i.e. symbolic or algebraic, computations.

Seeds is a project which implements Data structure and Algorithms! We aim for speed, flexible and the easy to use!

This is module for basic computation with floating point numbers. Numbers can have very wide mantissa for good precision, for realize "arbitrary-precision arithmetic". Module was adapt for BCB and MSVC compilers. Russian comments.

The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in a network as you want. With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do.

Dopamine is a research framework for fast prototyping of reinforcement learning algorithms. It aims to fill the need for a small, easily grokked codebase in which users can freely experiment with wild ideas (speculative research). This first version focuses on supporting the state-of-the-art, single-GPU Rainbow agent (Hessel et al., 2018) applied to Atari 2600 game-playing (Bellemare et al., 2013). Specifically, our Rainbow agent implements the three components identified as most important by Hessel et al., n-step Bellman updates, prioritized experience replay, and distributional reinforcement learning. For completeness, we also provide an implementation of DQN (Mnih et al., 2015). For additional details, please see our documentation. We provide a set of Colaboratory notebooks which demonstrate how to use Dopamine. We provide a website which displays the learning curves for all the provided agents, on all the games.

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. EasyCSP offers search algorithms for both CSPs and CSOPs. EasyCSP supports CSPs to be formalized using objects or int expressions. EasyCSP on GitHub: http://github.com/cordisvictor/easycsp-lib

GAVS+ (Game Arena Visualization and Synthesis, Plus!) is an open-source tool which enables to visualize a broad spectrum of algorithmic games used in verification and synthesis, and offers a standard interface with utility functions to establish connection with engineering practice. It is developed by Department of Informatics (Unit 6), TU München. The tool is mainly is served for research and educational purposes. The software is released under the GNU General Public License (v3). A slightly outdated tutorial (in PDF) is included in the zip file.

Simple library that provides the basic features to perform the time calculation between two times provided. The code of this library is published in the book: C++ Underground Programmer of the author Augusto Manzano (only portuguese). The book can be purchased from the "Clube de Autores" service - https://clubedeautores.com.br/book/209155--C_Underground_Programmer?topic=compiladores#.WNfZkJt_aKY. For more libraries, go to: https://sourceforge.net/u/augustomanzano/profile. To see my curriculum vitae go to: http://lattes.cnpq.br/8184615061457853. Augusto Manzano http://www.manzano.pro.br

This library performs the numerical conversion of Arabic numerical values into Roman numerals and Roman numeral values into Arabic numerals. This resource is developed with didactic and pedagogical objectives. Its commercial use may not be of extreme importance. The code of this library is published in the book: C++ Underground Programmer of the author Augusto Manzano (only portuguese). The book can be purchased from the "Clube de Autores" service - https://clubedeautores.com.br/book/209155--C_Underground_Programmer?topic=compiladores#.WNfZkJt_aKY. For more libraries, go to: https://sourceforge.net/u/augustomanzano/profile. To see my curriculum vitae go to: http://lattes.cnpq.br/8184615061457853. Augusto Manzano http://www.manzano.pro.br

Math4J is a java library with an object-oriented design of some mathematical ideas: functions, primality, complex numbers, etc. It also consists of some utility methods and classes for mathematical constructions.

Neural Network class library: Its a C/C++ implementation that provides following three neural architecture - Feed-forward network, Radial Basis function network, multi-layer perceptron and Self-Organizing Maps.

The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.

A fast way to rate the reading challenging level of book or text. Unlike well known reading metrics such as Fog, Kincaid, SMOG, ARI, Flesch, and Coleman-Liau readability this metric takes into account far more factors and is standarized against a corpus

S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. S-Match is extendable to host new algorithms.

This project's goal is to implement Artificial Inteligence algorithms and make them available for any platform but especially for mobile devices. The main objective is to allow the community to develop better and more inteligent mobile games.

KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.

XMLMath evaluates mathematical, logical or textual expressions described in xml and prints the result. For example, to compute the result of 1 + 1, you would write: <add> <long value="1"/> <long value="1"/> </add>

Cosmos (by OpenGenus Foundation) is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.