Matlab→Programming Methods And Algorithms

  • List, Queue, Stack

    Inspired from Java, the queue and stack are a litter faster than the native alternatives.'CStack' is used to define a stack data strcuture.'CQueue' is used to define a queue data strcuture. Requirements:· MATLAB 7.8 or higher

  • Gnu Fortran, C, Lapack And Blas From Windows Matlab

    According to the Matlab documentation the only supported Fortran compiler is Intel Visual Fortran.Two hack-around examples (one minimal and one realistic) of interfacing Fortran with Matlab via a C gateway function are included in the download packag

  • Publish To Mediawiki

    MediaWiki output code is presently used to power Wikipedia.This stylesheet converts from publishing's intermediate XML format to MediaWiki-compatible markup.The output is ready for cut-and-paste into Wikipedia or other sites running the MediaWiki sof

  • Unescape A Javascript String

    The syntax is "unescapeJavaScriptString" and is a great tool for when parsing HTML or JS. Requirements:· MATLAB 7.7 or higher

  • Maxloc

    It takes a data variable as input. Requirements:· MATLAB 7.5 or higher

  • Fortran Logical Mex Functions

    They provide a suite of functions to handle conversion of Fortran logical variables to/from MATLAB style mxArray variables in mex routines or engine applications.Assumes that the MATLAB logical class uses 1 byte for storage of each logical element. W

  • Use A Hash Table

    Class Hashtable provides ways for Matlab users to access hash tables data structures.The class allows multiple key-value pairs specified in 'get', 'put' and 'remove' methods, using cell arrays to collect inputs and outputs, and offers vector forms of

  • The Object Of My Callback

    It implements object references with Matlab timers. Requirements:· MATLAB 7.7 or higher

  • Pause4

    With 'PAUSE4(n)', a pause of 'n' seconds will be introduced when running the script.'n' can also be fractional.PAUSE4 without any arguments completes the pause routine. Requirements:· MATLAB 6.5.1 or higher

  • Ed

    It only works in the current working directory.Exact filename matches for files anywhere on the ML path will work just as if 'edit' were typed instead.The auto-complete function added to this tool makes it more useful thant the classic 'ed' function.

  • Cd

    In situations where the current directory contains a sub-directory, typing 'cd sub-directory' will change the directory as long as the partial match is non-ambiguous.If will work with even partial directory names.If there are two directory names star

  • Dijsktra

    The algorithm computes and returns the optimal path given the adjacency per cost sparse matrix and source - destination nodes. Requirements:· MATLAB 7.5 or higher

  • Rapid Lossless Data Compression Of Numerical Or String Variables

    Using the public domain ZLIB Deflator algorithm, these two functions (DZIP and DUNZIP) losslessly compress or decompress MATLAB variables of most data types so that they occupy less space.The class type, variable size and shape are stored inside the

  • Hungarian Algorithm For Linear Assignment Problems V2.1

    The script can also handle rectangular problems and problems with forbidden allocations. Requirements:· MATLAB 7.6 or higher

  • Roodi 1.4.0

    Roodi stands for Ruby Object Oriented Design Inferometer What's New in This Release: · Upgraded from ParseTree to ruby_parser.

  • 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 thei

  • 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 sta

  • 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 th

  • 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 t

  • 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).E

  
DMCA Notice-Privacy Policy
2004 - 2013 DownScripts. All rights reserved.