Apriori Algorithm Implementation
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 (107): Algorithm::BinPack Download |
Genetic Algorithm File Fitter, or just GAFFitter, is a command-line software written in C++ that arranges--via a genetic algorithm--an input list of items or files/directories into volumes of a certain capacity (target), such as CD or DVD, in a way that the total wastage is minimized. By smartly...
Platforms: *nix
License: Freeware | Size: 40.96 KB | Download (122): Genetic Algorithm File Fitter Download |
Algorithm::Permute is a Perl module with handy and fast permutation with object oriented interface. SYNOPSIS use Algorithm::Permute; my $p = new Algorithm::Permute([a..d]); while (@res = $p->next) { print join(", ", @res), "n"; } my @array = (1..9); Algorithm::Permute::permute { print...
Platforms: *nix
License: Freeware | Size: 10.24 KB | Download (108): Algorithm::Permute Download |
Algorithm::Merge is a Perl module package that provides three-way merge and diff. SYNOPSIS use Algorithm::Merge qw(merge diff3 traverse_sequences3); @merged = merge(@ancestor, @a, @b, { CONFLICT => sub { } }); @merged = merge(@ancestor, @a, @b, { CONFLICT => sub { } },...
Platforms: *nix
License: Freeware | Size: 10.24 KB | Download (92): Algorithm::Merge Download |
Algorithm::Huffman is a Perl extension that implements the Huffman algorithm. SYNOPSIS use Algorithm::Huffman; my %char_counting = map {$_ => int rand(100)} (a .. z, A .. Z); # or better the real counting for your characters # as the huffman algorithm doesnt work good with random data...
Platforms: *nix
License: Freeware | Size: 8.19 KB | Download (110): Algorithm::Huffman Download |
Optimization Algorithm Toolkit is a workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more. The project...
Platforms: *nix
License: Freeware | Size: 6.5 MB | Download (123): Optimization Algorithm Toolkit Download |
Algorithm::Networksort can create inline comparisons for sorting. SYNOPSIS use Algorithm::Networksort qw(:all); my $inputs = 4; # # Generate the network (a list of comparators). # my @network = nw_comparators($inputs); # # Print the list, and print the graph of the list. # print...
Platforms: *nix
License: Freeware | Size: 15.36 KB | Download (89): Algorithm::Networksort Download |
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 (93): Algorithm::Diff Download |
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 |
Real-Time Proactive Secret Sharing Library is an implementation of the Shamirs secret sharing scheme and Herzbergs proactive secret sharing algorithm. Real-Time Proactive Secret Sharing Library targets the RTAI OS. It includes a port of GNU GMP to RTAI, which is used for multiple precision...
Platforms: *nix
License: Freeware | Size: 1.3 MB | Download (115): Real-Time Proactive Secret Sharing Library 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::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 |
Bellagio is a sample implementation of OpenMAX IL for Linux. It enables software developers and ISVs to familiarize themselves with the OpenMAX IL API and to develop their own OpenMAX multimedia and streaming media components for mobile devices, including codecs, video I/O, and audio mixers....
Platforms: *nix
License: Freeware | Size: 501.76 KB | Download (128): Bellagio OpenMAX IL Implementation Download |
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 (100): Algorithm::Munkres 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 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 |