A new metaheuristic optimization algorithm, called Cuckoo Search (CS), is fully implemented, and the vectorized version is given here. This code demonstrates how CS works for unconstrained optimization, which can easily be extended to solve various global optimization problems efficiently.
These files are the MATLAB code for "Cuckoo Optimization Algorithm (COA)". Cuckoo Optimization Algorithm (COA) is inspired by the life of a bird family, called Cuckoo. Special lifestyle of these birds and their characteristics in...
MATLAB/C mixed implementation for Astar search algorithm
Usage: 1. Extract the zip file 2. Type "Mex Astar.cpp" in MATLAB command window to generate Astar.dll (you must choose to have such ability when installing...
Gravitational search algorithm (GSA) is an optimization algorithm based on the law of gravity and mass interactions.This algorithm is based on the Newtonian gravity: "Every particle in the universe attracts every other particle with a force...
SearchHippo - PHP Search Source Code is a very simple code that links SearchHippo.com with your site, thus enabling your site with a search engine. The default number of results per page are limited to 50, but the user can decrease or increase the...
A new hybrid population-based algorithm (PSOGSA) is proposed with the combination of Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA). The main idea is to integrate the ability of exploitation in PSO...
The A* search algorithm is a simple and effective technique that can be used to compute the shortest path to a target location. This tutorial presents a detailed description of the algorithm and an interactive demo.
The rainflow algorithm code has been prepared according to the ASTM standard (Standard practices for cycle counting in fatigue analysis) and optimized considering the calculation time.
This is a search algorithm but what makes it different is that it checks if the data you are looking for in the data matrix. if it is, it returns the position of it and the value at that position. if what you are searching for is not in the data...
Writing a binary search algorithm is surprisingly error-prone. The solution: trick the built-in bisect module into doing it for you.
The documentation for bisect says that it works on lists, but it really works on anything with a...
This is an implementation of the binary search algorithm in (almost) one line. Given a number 'n' and a list 'L', the function returns the index of the number on the list, or -1.
Particle swarm optimization is a derivative-free global optimum search algorithm based on the collective intelligence of a large group of intercommunicating entities. The individual particles are simple and primitive, knowing only their own...
Get new search engine for your site! New version with optimized search algorithm for faster searches. This advanced site search script written with search engines positioning in mind - result pages contain all proper tags to be submitted to...
The program constructs girth-6 type III qc-ldpc codes given base matrix and sub-matrix size. The sub-matrices sizes are variable. The program uses a search algorithm. It could fail to construct a code given some parameters. In that case the user...
Point it to a database and it creates Java classes, JSP, and Flex code. Emits code for create, update, delete, and search. Emits code for Flex charts. Then customize the code as needed. Tested with MySQL, Oracle, and Postgresql. Also can take a...
Two approaches to generate all combination of elements from a number of sets. Compares "classic" statically coded algorithms to a pythonic on-the-fly generation of specific algorithm code.
DSA extensions contains classes similar in purpose to the classes provided in java.util.
Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm.
In this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.
You want more? go to the Professional version of GLTree
It has been designed for uniformly...
this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.
You want more? go to the Professional version of GLTree
It has been designed for uniformly...
It's a deterministic iterative zero order algorithm that can be used to solve unconstrained optimization problem. It finds the relative minimum of a two variables function with a deterministic iterative zero order algorithm.
Pattern... |