LATEST free Matlab script downloads
Lexcmp
It uses the lexical ordering method to compare strings. Requirements: · MATLAB 7.5 or higher ...
Panjer
The script is very efficient in plotting the distribution of compound Poisson/Lognormal. Requirements: · MATLAB 7.5 or higher ...
Golaycodec
The encoding and decoding operations can be done with error correction for all transmission errors. Requirements: · MATLAB 7.5 or higher ...
Groebner
Each file is commented and has helpful information about the inputs, outputs and algorithms used. Requirements: · MATLAB 7.8 or higher ...
Piecewise Parabolic Interpolation
It performs piecewise parabolic interpolation and approximated calculation of first and second derivative at the interpolation point. Requirements: · MATLAB 5.2 or higher ...
image2data
Using a color bitmap and a horizontal color-bar, with all color levels ranging from left to right, data can be extracted from any image.The colorbar is used to generate an equivalent set of gray levels and the RGB components are properly converted to gray levels. Afterwards gray values are properly scaled ...
Moivre
This formula will calculate the roots of a multidimensional array of complex numbers. Requirements: · MATLAB 7 or higher ...
Sea surface
It uses the Pierson-Moskowitz spectrum for the frequency/wave-number dependency and four different types of angular spreading like cosinus-squared, Mitsuyasu, Hasselmann and none. Requirements: · MATLAB 7 or higher ...
Sea elevation
It needs as an input the value for wind speed to generate a stochastic sea-surface one-dimensional realization.It uses the Pierson-Moskowitz spectrum. Requirements: · MATLAB 7 or higher ...
Multiple Variable Traveling Salesmen Problem Genetic Algorithm
It finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations). Each salesman ...
Fixed Start Open Multiple Traveling Salesmen Problem Genetic Algorithm
Finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities without returning to the starting location).Each salesman starts at the first point, ...
Fixed Endpoints Open Multiple Traveling Salesmen Problem Genetic Algorithm
The script finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities and finally to the end location).Each salesman starts at the ...
Open Multiple Traveling Salesmen Problem Genetic Algorithm
Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once without returning to their starting location). Each salesman travels to a unique set of cities (although ...
Fixed Start End Point Multiple Traveling Salesmen Problem Genetic Algorithm
Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to individual cities and back to the original starting place).Each salesman starts at the first point, and ...
Multiple Traveling Salesmen Problem Genetic Algorithm
The script needs starting locations for every salesman taken into account in the algorithm.It will find a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their ...
Traveling Salesman Problem Nearest Neighbor
This method produces different results depending on what city is choosen as the starting point.This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes. Requirements: · MATLAB 7.6 or higher ...
Fixed Start Open Traveling Salesman Problem Genetic Algorithm
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 ...
Fixed Endpoints Open Traveling Salesman Problem Genetic Algorithm
The user has to supply the fixed ending points before the script can be ran. Requirements: · MATLAB 7.6 or higher ...
Open Traveling Salesman Problem Genetic Algorithm
The difference to the classic TSP is that the salesman doesn't travel in loop across the circuit. Requirements: · MATLAB 7.6 or higher ...
Traveling Salesman Problem Genetic Algorithm
The user is presented with the near-optimal solution and performance chart in a dialog window. Requirements: · MATLAB 7.3 or higher ...
Popular Scripts Search
gcal php
genetic algorithm for knapsack problem
course booking system
ajax file manager
rijndael encryption
animated loader
fade in slideshow
countdown clock
radial basis functions
gui asterisk pbx
syslog client
rss to email
matlab display
booking system
twitter add on
cover flow
embed html
cassandra client
amazon api
countdown timer
excel reader
plot graph
post form
alphabet algorithm
external authentication
calendar customizing
frameless window
embed video
imdb api
multi monitor