Home  |  About Us  |  Link To Us  |  FAQ  |  Contact

Algorithm freeware
Filter: All | Freeware | Demo

Algorithm

Added: February 03, 2010 | Visits: 658

Algorithm::SkipList is a Perl implementation of skip lists. SYNOPSIS my \$list = new Algorithm::SkipList(); \$list->insert( key1, value ); \$list->insert( key2, another value ); \$value = \$list->find(key2); \$list->delete(key1); This is an implementation of skip lists in Perl. Skip...

Platforms: *nix

Added: January 01, 2010 | Visits: 656

Algorithm::ScheduledPath is a Perl module that helps you to find scheduled paths in a directed graph. SYNOPSIS use Algorithm::ScheduledPath; use Algorithm::ScheduledPath::Path; \$graph = new Algorithm::ScheduledPath(); \$graph->add_edge( { path_id => R, origin => A, depart_time => 1,...

Platforms: *nix

Added: November 04, 2010 | Visits: 663

Algorithm::Munkres is a Perl extension for Munkres solution to classical Assignment problem for square and rectangular matrices. This module extends the solution of Assignment problem for square matrices to rectangular matrices by padding zeros. Thus a rectangular matrix is converted to square...

Platforms: *nix

Added: March 20, 2010 | Visits: 1.868

Algorithm::LUHN is a Perl module to calculate the modulus 10 double add double checksum. SYNOPSIS use Algorithm::LUHN qw/check_digit is_valid/; \$c = check_digit("43881234567"); print "It worksn" if is_valid("43881234567\$c"); \$c = check_digit("A2C4E6G8"); # this will cause an error...

Platforms: *nix

Added: May 02, 2010 | Visits: 770

Algorithm::AhoCorasick::SearchMachine provides an implementation and low-level interface of Algorithm::AhoCorasick. Feeds input to the state machine. First (after the instance) argument of this method is the input text (which can be empty, in which case the method doesnt do anything), second...

Platforms: *nix

Added: February 09, 2010 | Visits: 698

Algorithm::AhoCorasick provides efficient search for multiple strings. Aho-Corasick is a classic (1975) algorithm for locating elements of a finite set of strings within an input text. It constructs a finite state machine from a list of keywords, then uses the machine to locate all occurrences...

Platforms: *nix

Added: February 01, 2010 | Visits: 933

Algorithm::NeedlemanWunsch is a sequence alignment with configurable scoring. SYNOPSIS use Algorithm::NeedlemanWunsch; sub score_sub { if (!@_) { return -2; # gap penalty } return (\$_[0] eq \$_[1]) ? 1 : -1; } my \$matcher = Algorithm::NeedlemanWunsch->new(&score_sub); my \$score =...

Platforms: *nix

Added: February 27, 2010 | Visits: 744

Algorithm::Combinatorics Perl module is an efficient generator of combinatorial sequences. SYNOPSIS use Algorithm::Combinatorics qw(permutations); my @data = qw(a b c); # scalar context gives an iterator my \$iter = permutations(@data); while (my \$p = \$iter->next) { # ... } # list...

Platforms: *nix

The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point. Requirements: - MATLAB 7.6 or higher

Platforms: Windows, Mac, *nix, Matlab, BSD Solaris

Added: May 10, 2013 | Visits: 331

This SMAWK algorithm takes as input a function for computing matrix values, and searches for the position of maximum value in each row. The matrix must satisfy the "totally monotone" property: in each submatrix (in particular each 2x2 submatrix) the positions of the maxima must move leftward as...

Platforms: Windows, Mac, *nix, Python, BSD Solaris

Added: July 26, 2013 | Visits: 188

This is a simple implementation of the famous LZW algorithm.

Platforms: Matlab

Added: June 07, 2013 | Visits: 258

this algorithm predicts the received signal strength for the mobile user to avoid fluctuation in received signal strength during localization of the mobile user(finding mobile user's location)

Platforms: Matlab

Added: April 02, 2013 | Visits: 226

NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems, with a little bit more modification this can be...

Platforms: Matlab

Added: July 23, 2013 | Visits: 329

Gravitational search algorithm (GSA) is an optimization algorithm based on the law of gravity and mass interactions.This algorithm is based on the Newtonian gravity: "Every particle in the universe attracts every other particle with a force that is directly proportional to the product of their...

Platforms: Matlab

The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm. It is about 10 times faster than the munkres code...

Platforms: Matlab

Added: March 23, 2013 | Visits: 225

A flexible implementation of PSO algorithm with time-varying parameters. Algorithm is suitable for solving continuous optimization problems. Special care has been taken to enable flexibility of the algorthm with respect to its parameters and to initial population selection. Detailed logging of...

Platforms: Matlab

Added: August 19, 2013 | Visits: 269

findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).An independent set of a graph is a subset of vertices in which no two vertices areadjacent. Given a set of vertices, the maximum independent set problem callsfor finding the independent set of maximum...

Platforms: Matlab

We use the genetic algorithm (gatool) to determine the four parameters of the implicit Forst-Kalkwarf-Thodos Model. Predictions are in perfect agreement with data of vapour pressure of iodobenzene versus temperature for a temperature range from 380.15 K to 580.15 K.

Platforms: Matlab

Added: August 23, 2013 | Visits: 256

This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm). The new version (V2.2)is about 1.5 times faster than the old version (V2.1). It can solve a 1000 x 1000 problem in about 20 seconds in a Core Duo (T2500 @ 2.00GHz) XP laptop with Matlab...

Platforms: Matlab