Search Results for "linear programming" - Page 2

libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported.

F2what is an open source project to translate algorithmic fortran to a variety of languages (java, dotnet and VBA so far). It offers a Fortran77 parser with code transformations, variable disambiguation, and modular output to other programming languages. It also offers already translated versions of Lapack and quadprog to Java, .Net and VBA, to give access to SVD, LU, QR, Cholesky, eigenvalue decomposition, linear system solving and QP optimization in those three languages.

As you may recall, a Turing-machine is an all-purpose computer. A Turing-machine has a memory that consists of a track or line of data. On the track, a read-/write-head is moving. The read-write head itself is a state engine, which is affected by the input from the track, and which decides what to write on the track, and where to read the next input, by "moving" the head back or forth. In 5050, the part of the track left of the head is represented not by a line or stack of information,...

Software to solve Linear Programming problems applying the Revised Simplex Algorithm (2-Phase Method) and performing a Sensitivity Analysis too.

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.

This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.

Tsunami is an open-source high performance computing language. With it you can write streaming data-parallel algorithms that utilize GPGPUs for orders-of-magnitude speed-up with the ease of writing sequential algorithms.

Ajanta is a Java API to solve linear programming problems. Linear programming is a method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given list of constraints.

The Auckland Layout Model is a platform-independent 2D layout technology for arranging the controls in a GUI. The model supports the specification of constraints based on linear algebra, and an optimal layout is calculated using linear programming.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G