Download Shareware and Freeware Software for Windows, Linux, Macintosh, PDA

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

Serving Software Downloads in 976 Categories, Downloaded 29.862.022 Times

Algorithm 2 freeware
Filter: All | Freeware | Demo
Display by: Relevance |  Downloads |  Name

Algorithm 2

1 2 3 4 5 > 
Released: August 07, 2014  |  Added: September 08, 2014 | Visits: 698

Algorithm Do you want to create your own apps? How to automate my business processes by myself? Algorithm2 is a free tool for game and software development at home. With its help anybody can create a program without a knowledge of any programming language. Up-to-date components will let you to create...



Platforms: Windows, Windows 8, Windows 7, Windows Server

License: Freeware Size: 8.53 MB Download (47): Algorithm Download

Released: February 25, 2014  |  Added: February 25, 2014 | Visits: 145

SARSSv8 SARSS (Send and receive secure sms) Windows Phone 8 Version, Release 1.0 SARSS is a tiny but powerful windows phone application, allowing you to send encrypted sms/email messages. The software is using a custom symmetric key encryption algorithm, meaning that the same password is using for both...





Platforms: Windows Phone

License: Freeware Size: 2 MB Download (7): SARSSv8 Download

Added: August 23, 2013 | Visits: 260

Hungarian Algorithm for Linear Assignment Problems (V2.2) 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

License: Freeware Size: 10 KB Download (19): Hungarian Algorithm for Linear Assignment Problems (V2.2) Download

Added: April 26, 2010 | Visits: 608

Algorithm::Diff::Apply Algorithm::Diff::Apply is a Perl module to apply one or more Algorithm::Diff diffs. SYNOPSIS ## Single-diff form: use Algorithm::Diff::Apply qw{apply_diff}; my @ary = ...; my @diff = ...; # some call to Algorithm::Diff::diff() my @changed_ary = apply_diff(@ary, @diff); my $changed_ary =...


Platforms: *nix

License: Freeware Size: 12.29 KB Download (73): Algorithm::Diff::Apply Download

Added: January 17, 2010 | Visits: 760

Algorithm::BinPack Algorithm::BinPack is a Perl module that can efficiently pack items into bins. SYNOPSIS Algorithm::BinPack efficiently packs items into bins. The bins are given a maximum size, and items are packed in with as little empty space as possible. An example use would be backing up files to CD,...


Platforms: *nix

License: Freeware Size: 4.1 KB Download (83): Algorithm::BinPack Download

Added: February 19, 2010 | Visits: 646

Algorithm::SISort Algorithm::SISort is a Perl module that contains select and insert sorting algorithm. SYNOPSIS use Algorithm::SISort qw(Sort Sort_inplace); @sorted_list = Sort {$_[0] <=> $_[1]} @unsorted_list; # ... or ... $number_of_comparisons = Sort_inplace {$_[0] <=> $_[1]} @unsorted_list; This...


Platforms: *nix

License: Freeware Size: 4.1 KB Download (82): Algorithm::SISort Download

Added: July 09, 2010 | Visits: 685

Algorithm::SocialNetwork Algorithm::SocialNetwork is a social network analysis. SYNOPSIS use Graph::Undirected; use Algorithm::SocialNetwork; my $G = Graph::Undirected->new(); $G->add_edges([qw(a b)], [qw(b c)]); my $algo = Algorithm::SocialNetwork->new(graph => $G3); my $BC = $algo->BetweenessCentrality(); #...


Platforms: *nix

License: Freeware Size: 9.22 KB Download (85): Algorithm::SocialNetwork Download

Added: February 07, 2010 | Visits: 552

Algorithm::Diff Algorithm::Diff is a Perl module to compute `intelligent differences between two files / lists. SYNOPSIS require Algorithm::Diff; # This example produces traditional diff output: my $diff = Algorithm::Diff->new( @seq1, @seq2 ); $diff->Base( 1 ); # Return line numbers, not indices...


Platforms: *nix

License: Freeware Size: 33.79 KB Download (75): Algorithm::Diff Download

Added: July 07, 2010 | Visits: 980

Algorithm::Line::Bresenham 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 (111): Algorithm::Line::Bresenham Download

Released: July 10, 2012  |  Added: July 10, 2012 | Visits: 891

Algorithm::Pair::Best 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 (86): Algorithm::Pair::Best Download

Added: February 03, 2010 | Visits: 659

Algorithm::SkipList 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 (98): Algorithm::SkipList Download

Added: January 01, 2010 | Visits: 658

Algorithm::ScheduledPath 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 (72): Algorithm::ScheduledPath Download

Added: November 04, 2010 | Visits: 666

Algorithm::Munkres 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

License: Freeware Size: 9.22 KB Download (82): Algorithm::Munkres Download

Added: May 02, 2010 | Visits: 773

Algorithm::AhoCorasick::SearchMachine 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 (96): Algorithm::AhoCorasick::SearchMachine Download

Added: February 01, 2010 | Visits: 939

Algorithm::NeedlemanWunsch 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 (86): Algorithm::NeedlemanWunsch Download

Released: November 23, 2012  |  Added: November 23, 2012 | Visits: 386

Image Compare 2 The Image Compare 2 tool manages to find duplicate images, that can be deleted with a single mouse click. It uses a unique algorithm to detect if an image is identical or similar, even when it is scaled or rotated. Image Compare 2 now comes with an improved comparison algorithm, using thumbs...


Platforms: Windows

License: Freeware Download (91): Image Compare 2 Download

Added: June 03, 2013 | Visits: 208

Extended Euclidean Algorithm for polynomials over GF(2^m) Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in addition to the gcd of a(x) and b(x) such that gcd =...


Platforms: Matlab

License: Freeware Size: 10 KB Download (18): Extended Euclidean Algorithm for polynomials over GF(2^m) Download

LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem 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: August 19, 2013 | Visits: 272

Heuristic Algorithm for finding Maximum Independent Set 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 (19): Heuristic Algorithm for finding Maximum Independent Set Download

Added: August 20, 2013 | Visits: 245

Maximum(minimum) Weight Spanning Tree ( Directed ) We use the idea of Chu-Liu/Edmonds Algorithm, see paper [1,2], to implement four functions here.1. Maximal Directed Maximum Spanning Tree By DirectedMaximumSpanningTree.m2. Minimal Directed Maximum Spanning Tree By DirectedMinimalSpanningTree.m3. Maximal Directed Maximum Spanning Forest By...


Platforms: Matlab

License: Freeware Size: 10 KB Download (20): Maximum(minimum) Weight Spanning Tree ( Directed ) Download

1 2 3 4 5 >