Open Source BSD Algorithms

ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects.

That project (RMOL) aims at giving developers concerned by the Revenue Management arena a library delivering a reference implementation for most of the published algorithms and methods. That library is intended to be used in simulated environment: it does not intend to be used in real world production systems.

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.

OpenDiscreteDynamicProgrammingTemplate : founds optimal constrainted parameters of a discrete controls with second order optimization template replacing Hessian with directional derivatives and backpropagation for digital filter(as neural network)

GLARE is a library and a software for product based optimization of reagent lists in the context of a chemical combinatorial library design. Large virtual combinatorial libraries containing 10^12 products have been optimized within a second.

Fully playable Java game demo illustrating basic game programming technics, such as sprite animation, pixmap fonts, time or frame related game loop, affine transformations, convolution filters, sound generation and playback...

Cross-platform C++ library for Reverse Polish Notation calculus. Focuses on providing a reusable set of RPN functionalities such as parsing, variable substitution and computation.

CthughaNix is the reincarnation of Cthugha-L, a Linux port of one of the first audio visualization software packages, known as "An Oscilloscope On Acid".

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

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).

Gamoliyas is an open source John Conway's Game of Life game totally written in DHTML (JavaScript, CSS and HTML). Uses mouse and keyboard. Very configurable. This cross-platform and cross-browser game was tested under BeOS, Linux, *BSD, Windows and other

Das Horner-Schema ist ein schnelles und einfaches Verfahren, um einen Funktionswert von Polynomen an einem gegeben Wert zu berechnen. Dieses Projekt beinhält eine Facharbeit und Programmierbeispiele in Pascal und Java zum Thema.

The K.U.Leuven JCHR System is an integration of Constraint Handling Rules (CHR) and Java designed with three aims in mind: user-friendliness, flexibility and efficiency. http://www.cs.kuleuven.be/~petervw/JCHR/

The JAccumulator package brings the convenient type conversion and ad hoc composition capabilities of Javascript to Java programming structures. JAccumulator is dependent upon the Jupperware (http://jupperware.sf.net) to provide Javascript-like associative list capabilities and the convenience of easy hierarchical construction.

M+ Compiler/Interpreter is a interpreter library written in Java that delivers the possibility to extend any Java application with simple scripts. Besides the usage of native datatypes and operations you can instantiate and call native Java objects.

The NSketch library provides implementations of most common sketch-based algorithms (histograms, quantile, frequent items, bloom filter ...). The library is written in C# for .Net.

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.

PopED (Population Experimental Design) is a software tool for computing optimal experimental designs. The software has been developed with an emphasis on drug trials based on population models (non-linear mixed effects models).

pvmfractal is a highly customizable fractal viewing application, that can work interactively as an SDL or Curses app, or in batch mode as a console app. It includes many coloring algorithms, layers, and can use multiple computers for calculation using PV

A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.

This Python module provides basic facilities for mathematics on fixed-point numbers. The number of fractional binary digits is tunable, allowing near-arbitrary precision arithmetic. Arithmetic & functions such as sqrt, exp, log, sin & cos are available. For the latest releases please visit https://github.com/rwpenney/spfpm

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

Wallaroo is an infinite precision constraint solving and optimization library for linear constraints over the rational numbers. It handles equalities (=), inequalities (<=, >=), strict inequalities (<, >), and disequalities (!=).

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>

iVSwap is a simple function which can be used as a library and swaps values between two variables in a mathematical way using a classic Boolean algebra law without the need of a buffer! The advantages of this technique is speed and portability.