Algorithm Computing

Golden section method - searching for minimum of the function on given interval files:golden.m - main algorithm, computing minimum on intervalf.m - given function - file to modify by the user! Platforms: Matlab

G = VECGCD(V) is the greatest common divisor of the elements of the integervector V. V must be a row or a column vector of integers.We define gcd([]) = 1 and gcd([0 0 ... 0]) = 0.I believe that this routine is faster than recursively computing GCDs and the algorithm is simple enough to be used... Platforms: Matlab

Implementation of Nicholas J. Higham's algorithm "Computing the Nearest Correlation Matrix - A Problem from Finance", 2002.http://eprints.ma.man.ac.uk/232/01/covered...S_ep2006_70.pdf Platforms: Matlab

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

Parallel Genetic Algorithm Library (or PGAL for short) is a C++ toolkit for simply, efficiently, and swiftly producing genetic algorithm code that works across multiple processors. This is useful not only for those with multi-processor computers, but also for distributed and cluster computing... Platforms: *nix

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

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

Even if totally m-coded, this routine is particularly fast in computing convex hull of 2D points. In many cases seems to be much faster than the matlab library routine. The main reason is that, differently from convhull, this algorithm jumps the call to unique function which can be very slow for... Platforms: Matlab

I am describing a solution that allows you to break apart and run large amounts of your Matlab code in parallel on large computational pools. In order to provide the user with the familiar Matlab work environment, I glue back the remotely evaluated Matlab code via web services, such that the... Platforms: Matlab

The harmony elements algorithm is proposed as a global searching technique of numerical computing which inspired by the old Chinese philosophy: Doctrine of Wu Xing, the five color theorem, and the Hoffman-Singleton graph. According to operation of overcoming and generating policy, each element in... Platforms: Matlab

Algorithm::Dependency is a base class for implementing various dependency trees. SYNOPSIS use Algorithm::Dependency; use Algorithm::Dependency::Source::File; # Load the data from a simple text file my $data_source = Algorithm::Dependency::Source::File->new( foo.txt ); # Create the... Platforms: *nix

Algorithm::Knapsack is a brute-force algorithm for the knapsack problem. SYNOPSIS use Algorithm::Knapsack; my $knapsack = Algorithm::Knapsack->new( capacity => $capacity, weights => @weights, ); $knapsack->compute(); foreach my $solution ($knapsack->solutions()) { foreach my $index... Platforms: *nix

Algorithm::DiffOld is a Perl module to compute `intelligent differences between two files / lists but use the old (<=0.59) interface. NOTE This has been provided as part of the Algorithm::Diff package by Ned Konz. This particular module is ONLY for people who HAVE to have the old interface,... Platforms: *nix

Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*. SYNOPSYS use Algorithm::Loops qw( Filter MapCar MapCarU MapCarE MapCarMin NextPermute NextPermuteNum NestedLoops ); my @copy= Filter {tr/A-Z.,"()/a-z/d} @list; my $string= Filter... Platforms: *nix

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

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

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

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

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

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