A few popular metaheuristic algorithms are included, such as the particle swarm optimization, firefly algorithm, harmony search and others.
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...
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...
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.
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.
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...
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...
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...
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...
This module implements a stemming algorithm to improve search results in Spanish with the Drupal built-in search module.
It reduces each word to its basic root or stem (for instance, "preguntando", "preguntar",...
Maximum length sequence assuming distinct values = baseVal^powerVal-1
[ms]=mseqSearch(powerVal,baseVal) OUTPUT: ms: generated maximum length sequence, of length basisVal^powerVal-1 such that all values...
Search value 'v' in sorted vector 'x' and find index and value with respect to vector x that is equal or closest to 'v'.
If more than one value is equal then anyone can be returned (this is property of binary search). If... |