Optimization Algorithm
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::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 (114): Algorithm::AhoCorasick::SearchMachine 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 |
PC Brother Memory Optimization Free is a powerful but easy-to-use system application that can optimize your PC, as well as show you the current system usage in both graph and by numbers. It can help your PC operate more efficiently and run faster.
This totally free application is user...
Platforms: Windows
License: Freeware | Size: 2.6 MB | Download (1731): PC Brother Memory Optimization Free Download |
The Memory Optimization tool was developed to be a powerful but easy-to-use system application that can optimize your PC. Usage tab window of Memory Optimization lets you see the CPU memory and page file usage levels. Settings window of Memory Optimization will allow users to set the display mode...
Platforms: Windows
License: Freeware | Download (416): Memory Optimization Download |
PC Brother Memory Optimization is a powerful but easy-to-use system application that can optimize your PC, as well as show you the current system usage in both graph and by numbers. It can help your PC operate more efficiently and run faster.
This totally free application is user friendly. To...
Platforms: Windows
License: Freeware | Size: 2.6 MB | Download (413): PC Brother Memory Optimization 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 |
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
License: Freeware | Download (53): SMAWK totally monotone matrix searching algorithm Download |
This function decorates a function with tail call optimization. It does this by throwing an exception if it is it's own grandparent, and catching such exceptions to fake the tail call optimization. This function fails if the decorated function recurses in a non-tail contexif the de />
Platforms: Windows, Mac, *nix, Python, BSD Solaris
License: Freeware | Download (56): Tail Call Optimization Decorator Download |
This is a simple implementation of the famous LZW algorithm.
Platforms: Matlab
License: Freeware | Size: 30.72 KB | Download (48): LZW Compression Algorithm Download |
this algorithm predicts the received signal strength for the mobile user to avoid fluctuation in received signal strength during localization of the mobile user(finding mobile user's location)
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (42): Grey prediction algorithm for mobile user localization Download |
Particle swarm optimization is a technique used in many control systems application. Here i used the PSO in PID controller tuning
Platforms: Matlab
License: Freeware | Size: 30.72 KB | Download (49): Tunning of PID controller using Particle Swarm Optimization Download |
The files in this folder solve the optimization case studies described in the paper "VaR vs CVaR in Risk Management and Optimization" by Sarykalin,S., Serraino,G., and Uryasev,S., in Tutorials in Operations Research, INFORMS 2008 (download www.ise.ufl.edu/uryasev/VaR_vs_CVaR_INFORMS.pdf...
Platforms: Matlab
License: Freeware | Size: 225.28 KB | Download (50): VaR vs CVaR in Risk Management and Optimization Download |
This software contains one example taken from the reference paper given with this program..By running the file P1.m as they are in the default ABC-eld folder the economic dispatch problem can be solved. The allocation minimum fuel cost and transmission losses are determined. By running the...
Platforms: Matlab
License: Freeware | Size: 30.72 KB | Download (55): Solution to Economic Dispatch by Artificial Bee colony Algorithm Download |
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
License: Freeware | Size: 10 KB | Download (55): LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem Download |
We use the genetic algorithm (gatool) to determine the four parameters of the implicit Forst-Kalkwarf-Thodos Model. Predictions are in perfect agreement with data of vapour pressure of iodobenzene versus temperature for a temperature range from 380.15 K to 580.15 K.
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (47): Model Determination using Genetic Algorithm: Forst-Kalkwarf-Thodos Model Download |
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 (45): Hungarian Algorithm for Linear Assignment Problems (V2.2) Download |