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

Algorithm Examples software
Filter: All | Freeware | Demo

# Algorithm Examples

Added: July 25, 2013 | Visits: 211

python-bidi is a bi-directional layout implementation in pure Python. API The algorithm starts with a single entry point bidi.algorithm.get_display. Required arguments: * unicode_or_str: The orginal unicode or string (i.e: storage). If it's a string use the optional argument encoding to... Platforms: *nix

Added: June 04, 2013 | Visits: 234

We propose a new global optimization algorithm based on a harmony search scheme, termed as harmony element string algorithm (abbreviated as HEA). The algorithm has five fundamental features: (1) The states of the system is represented by strings of elements {0,1,2,3,4} and hence the search of the... Platforms: Matlab

This function uses Evolution Strategies (ES) instead of Genetic Algorithms (GA) as Evolutionary Algorithm (EA) in the NSGA-II procedure for multi-objective optimization.The algorithm is able to find the pareto optimal front in most of the functions implemented in the file 'Examples.m', but the... Platforms: Matlab

Added: November 30, 2013 | Visits: 160

ParserFunction is a free and open source Haskell algorithm with a function called expressionToDouble, which parses an expression (in the form of a string) and returns a Double. Examples of this function can be found by viewing the source code for this module. Platforms: Mac

Added: January 18, 2010 | Visits: 792

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

Added: October 17, 2010 | Visits: 1.830

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

Added: March 22, 2010 | Visits: 629

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

Added: April 09, 2010 | Visits: 683

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

Added: April 26, 2010 | Visits: 641

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

Added: May 06, 2010 | Visits: 1.728

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

Added: January 13, 2010 | Visits: 1.452

Array::Each::Tutorial - POD giving various examples how to use Array::Each. SYNOPSIS man Array::Each man Array::Each::Tutorial or perldoc Array::Each perldoc Array::Each::Tutorial Overview This tutorial contains only POD, so dont do this: use Array::Each::Tutorial; # dont do this... Platforms: *nix

Added: January 17, 2010 | Visits: 794

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

Added: September 29, 2013 | Visits: 703

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

Added: April 25, 2010 | Visits: 694

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

Added: March 13, 2010 | Visits: 1.109

GCJ::Cni::Examples is a Perl module with examples of how to use GCJs CNI interface to write Perl Modules in Java. EXAMPLES Writing Treaded modules in Java One benefit of using GCJ is that it takes advantage of POSIX threading. This is nice since Perls threading model is, shall we say, less... Platforms: *nix

Added: November 09, 2010 | Visits: 957

GNUstep examples is a collection of programs that are meant to show programmers how to use GNUstep. GNUstep examples includes a calculator, a currency converter, finger, fractal, puzzle, hostaddress, and ink (a simple editor). Whats New in This Release: - Minor feature enhancements. Platforms: *nix

Added: February 19, 2010 | Visits: 675

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

Added: November 16, 2010 | Visits: 771

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