Open Source Algorithms - Page 13

Aim is to develop a library of utility functions to efficiently simulate division, multiplication, mod, finding first 1/0 bit etc. (using shift and add/subtract) for software development on low cost dsp systems lacking these.

High-performance computing code and libraries used in the High Performance Computing subject in Telecommunications Engineering at the University of Granada (http://geneura.ugr.es/~jmerelo/asignaturas/AAP)

Test of Artificial Life

Toolbox for Java developers. Includes right now only a multi-layered extensible cache system but will grow depending on requirements.

Delphi class which implements an associative array. Keys can be strings or integers. Keys are stored in Red-Black tree. Array can contain TObjects or it descendants.

The Asterisk Config PHP-Parser claims to be a simple but effective function writen in PHP non-OOP that is capable to parse any standard .conf Asterisk configuration file an drop the data into a multi-dimensional array.

Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms.

AsyncSocket is a python module used for asynchronous socket connections that supports connection and read/write timeouts.

Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.

Very useful framework library, contains many frequent used code snippets, algorithms, data structures, WinForms & APS.NET controls for all-day work.

Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;

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

For arbitrary precision mathematics PHP offers the Binary Calculator which supports numbers of any size and precision, represented as strings. This project replicates this in JavaScript (bcadd, bccomp, bcdiv, bcmul, bcsub, etc)

A C++ library for Bayesian computation, including a collection of more generally-applicable utilities.

Balie - BAseLine Information Extraction (in Java) This project is not maintained anymore.

Barracuda is a circuit board analyzer that analyze PCB and make sure the new boards doesn't contain errors Barracuda has now his first release, The error detection works fine, but it require to much calibration to get good pictures.

Unlike the other two, openai/baselines is not currently a maintained or prominent repo in the OpenAI organization (and I found no strong reference in OpenAI’s main GitHub). Historically, “baselines” repositories are often used for baseline implementations of reinforcement learning algorithms or reference models (e.g. in the RL domain). If there was an OpenAI “baselines” repo, it might have contained reference implementations for reinforcement learning or model policy baselines to compare new work against. However, I couldn’t locate an active “openai/baselines” in the latest OpenAI repos, so it may have been archived, removed, or merged into other projects. If you meant a different “baselines” (e.g. OpenAI Baselines for reinforcement learning), I can look up that specific one.

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.

A tool to extract taxonomy from OWL ontology, translate it into Bayesian Nets and integrate uncertainty knowledge into result BNs.

A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be used to create any logical system. In this early version, I'm still working on edge detection and its understanding of the same shapes at different brightnesses. This will be a module of the bigger Human AI Net project and will be used for adding realtime intuitive high dimensional intelligence in audio and visual interactions with the user.

Beagle is Java open source framework for running and managing nondeterministic algorithms such as genetic algorithms for solving complex problems. Beagle is fully modular and maintains whole history of algorithm progress for further analysis.

Bebops ("Belief Base Operations") provides semi-revision, contraction and kernel operators for an OWL-backed Belief Base.

Belkerda is a simple Python AI program that takes a user's input, builds a log of random numbers, picks a random entry, and displays it. If it is correct, then it reenters that number back into the log several times, overwriting the original, random numbers. If it is not, however, it overwrites a lower amount of entries.