Searching Algorithm

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

This script implements a string searching algorithm based upon Boyer-Moore string searching, which is considered one of the most efficient string searching algorithms. Boyer-Moore-Horspool only uses the bad-suffix window for matching and is therefore simpler to implement and faster than normals... Platforms: Windows, Mac, *nix, Python, BSD Solaris

FastSS is a string similarity searching algorithm. For each query, which consists of query string s and distance d, it retrieves all the words in a dictionary whose edit distance from s is equal or smaller than d. FastSS is an offline searching algorithm, as it needs to create an index of its... Platforms: *nix

Search::FreeText is a free text indexing module for medium-to-large text corpuses. SYNOPSIS my $test = new Search::FreeText(-db => [DB_File, "stories.db"]); $text->open_index(); $text->clear_index(); $text->index_document(1, "Hello world"); $text->index_document(2, "World in motion");... Platforms: *nix

Perlfect Search is an integrated, general purpose, site indexer and search engine. It comes as a pair of disctinct scripts. The indexer, that automatically, scans and indexes a web site, and the search engine, a cgi script that serves search queries for keywords over the index, and displays... Platforms: Windows, Mac, *nix, Perl, BSD Solaris

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

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

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

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

An animated simulation of Particles in 2D searching for a global minima of a simple function using Particle Swarm Optimization algorithm Platforms: Matlab

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 programme implements Quasi Linearization Algorithm for searching optimal control trajectory, implemented for example of CSTR from book of Optimal Control Engineering by KIRK, 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

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