Search Results for "algorithm"

Implementation of algorithm allowing Time Series Forecasting.

Designed to help you with nonlinear, multidimensional, multi-parameter regression, using the Levenberg-Marquardt algorithm. The regression model can be set up using the input syntax of most modern cas. Full featured visualization and data edit mask. Regression Easy needs help. Especially need to catch exceptions and give reasonable error messages. (In the moment, the standard error handler is invoked. Simply click "resume" on any error.) For newest binary builds, look in the "/bin...

Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal...

Vijner 974 E-Sys (2048 bits and unlimited encryption). Enables easy (un-)encryption from text input or .txt file, and to (un-)encrypt raw files, with Vigenère Algorithm + unlimited encryption keys. Simple and powerful. Adapt to fit your needs.

A .NET implementation of the Gabow, Kaplan, Tarjan algorithm for testing the uniqueness of a perfect matching in a general graph.

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

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)