Search Results for "objective c"

Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming. ● LiPS gives sensitivity analysis procedures, which allow us to...

MuPuPriNT (Multi-Purpose Prime Number Tester) is a primality and compositeness tester for many different types of numbers. It is basic, yet full-featured, and offers several different testing methods for each type of number. MuPuPriNT is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for Windows, OS X, and Linux. Source code is available as well, and can be built on any machine with Qt installed. As of version 2.0, MuPuPriNT is built on the...

If you are looking for the 64-bit version, find it here: http://sourceforge.net/projects/gjsieve/files/200/gjsieve203.exe/download GJSieve is a basic, yet full-featured sieve and tester for numbers of several classifications, including Proth, Cullen, and Woodall. GJSieve is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for both Windows and OSX. Currently, the application differs greatly across platforms. This may change in the future. They...

...More can be read about it at: http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces Craig's website for the problem: http://www.knechtmagicsquare.paulscomputing.com/ The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden, for the Astra Group which does research about Constraint Programming and related technologies: Water Retention on Magic Squares with Constraint-Based Local Search http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-176018 I 'm posting two solvers in this project. One written in C++ which is the fastest, at least for the heavier objective functions, and a Dynadec Comet solver which lets you easily post new constraints along with the Magic-constraints. Author: Johan Öfverstedt

The objective of SPUC is to provide the Digital Communications Systems Designer or DSP Algorithm designer with simple, efficient and reusable DSP building block objects written in C++.

6Vertex is an Objective C/Cocoa application (and standard C functions) for computing and visualizing matrix models generated with the 6-vertex model for computing boundary shapes and phase transition shapes for differently weighted vertices.

Computational modelling is a interdisciplinary field spanning many techniques and programming languages. AgenTools is a project dedicated to establishing increased modularity in scientific computing packages and a portal linking to other existing project

A fractal generator that relies on cooperative computing for complex calculation.

Baculator is a Reverse Polish Notation (RPN) calculator program with an infinite scrollable stack and support for most common mathematical operations as well as some more esoteric operations. Available for Unix/Gtk+, Mac OS X, and MS Windows.

Yet another Fuzzy Logic framework.

This is an ocaml binding for LevMar Minimization library. The library offers minimization from IR^n to IR^d finding the point which minimizes the distance ||f(p)-x0|| where x0 is the solution in the image space. The binding enables to use ocaml functions