![](/resources/circle.gif)
![](/resources/circle.gif)
![](/resources/circle.gif)
![](/resources/circle.gif)
![](/resources/circle.gif)
![](/resources/circle.gif)
![](/resources/circle.gif)
![](/resources/circle.gif)
![](/resources/circle.gif)
![](/resources/circle.gif)
Serving Software Downloads in 956 Categories, Downloaded 50.479.188 Times
Algorithm::Line::Bresenham is a Perl module that contains a simple pixellated line-drawing algorithm. SYNOPSIS use Algorithm::Line::Bresenham qw/line/; my @points = line(3,3 => 5,0); # returns the list: [3,3], [4,2], [4,1], [5,0] line(3,3 => 5,0, &draw_line); # calls draw_line on each...
Platforms: *nix
License: Freeware | Size: 3.07 KB | Download (140): Algorithm::Line::Bresenham Download |
Algorithm::C3 is a module for merging hierarchies using the C3 algorithm. SYNOPSIS use Algorithm::C3; # merging a classic diamond # inheritence graph like this: # # # / # # / # my @merged = Algorithm::C3::merge( D, sub { # extract the ISA array # from the package no...
Platforms: *nix
License: Freeware | Size: 8.19 KB | Download (130): Algorithm::C3 Download |
Algorithm::Pair::Best is a Perl module to select pairings (designed for Go tournaments, but can be used for anything, really). SYNOPSIS use Algorithm::Pair::Best; my $pair = Algorithm::Pair::Best->new( ? options ? ); $pair->add( item, ? item, ... ? ); @pairList = $pair->pick( ? $window...
Platforms: *nix
License: Freeware | Size: 10.24 KB | Download (118): Algorithm::Pair::Best Download |
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
License: Freeware | Size: 30.72 KB | Download (117): Algorithm::SkipList Download |
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
License: Freeware | Size: 20.48 KB | Download (90): Algorithm::ScheduledPath Download |
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
License: Freeware | Size: 4.1 KB | Download (510): Algorithm::LUHN Download |
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
License: Freeware | Size: 5.12 KB | Download (114): Algorithm::AhoCorasick::SearchMachine Download |
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
License: Freeware | Size: 5.12 KB | Download (144): Algorithm::AhoCorasick Download |
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
License: Freeware | Size: 10.24 KB | Download (105): Algorithm::NeedlemanWunsch Download |
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
License: Freeware | Size: 15.36 KB | Download (153): Algorithm::Combinatorics Download |
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
License: Freeware | Download (49): Fixed Start Open Traveling Salesman Problem - Genetic Algorithm Download |
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
License: Freeware | Download (53): SMAWK totally monotone matrix searching algorithm Download |
This is a simple implementation of the famous LZW algorithm.
Platforms: Matlab
License: Freeware | Size: 30.72 KB | Download (48): LZW Compression Algorithm Download |
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
License: Freeware | Size: 10 KB | Download (42): Grey prediction algorithm for mobile user localization Download |
Finding the Fourier transform of a rectangular pulse..filtering the spectrum and regenerating the signal usingthe filtered spectrum is done...at the end Rayleigh theorem is proved by showing that the energy content of both time domain and frequency domain signals are equal..your comments are...
Platforms: Matlab
License: Freeware | Size: 215.04 KB | Download (45): Fourier Analysis of a Rectangular Pulse Download |
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
License: Freeware | Size: 10 KB | Download (48): NSGA - II: A multi-objective optimization algorithm Download |
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
License: Freeware | Size: 10 KB | Download (52): Gravitational Search Algorithm (GSA) Download |
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
License: Freeware | Size: 10 KB | Download (55): LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem Download |
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
License: Freeware | Size: 10 KB | Download (40): Particle Swarm Optimization (PSO) algorithm Download |
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
License: Freeware | Size: 10 KB | Download (49): Heuristic Algorithm for finding Maximum Independent Set Download |