Five elements algorithm 1.0
File ID: 85727
Five elements algorithm 1.0 Description
Description: 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 overcoming and generating policy, each element in individuals altered extremely rapid during algorithm running period. The extreme rapid changing of individuals oriented by rule of deduction and generation, so the algorithm could made function quickly reach to the best solution. Inspired by five color theorem, we choose five elements 0s, 1s, 2s, 3s, and 4s consisting of each individual strings represent as candidate solutions. The algorithm method which generated from Hoffman-Singleton graph made whole algorithm could be globally covering every existing candidate solutions during algorithm running, so the algorithm would not be able to trap into local optimization value.
Related: Solution, reach, inspired, choose, Individual, consisting, quickly, Function, changing, Extreme, Oriented, deduction, Generation, Strings, represent, existing, Local
O/S:BSD, Linux, Solaris, Mac OS X
File Size: 276.5 KB
|More Similar Code|
This algorithm searches for more than one element in a list. The input is a list that you want to search through and a list of elements that you want to search for. The output is a multidimensional list with the positions of the elements you are searching for in the search list in the order that you listed them.
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...
Evolutionary Structural Optimization Package (ESOP) consists of software for viewing, analyzing, and optimizing structures containing beam, truss, and membrane plate elements utilizing OpenGL and the Genetic Algorithm (GA). Created for use in M.S....
This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one.
This is a pure Python implementation of the rsync algorithm. On my desktop (3.0GHz dual core, 7200RPM), best case throughput for target file hash generation and delta generation is around 2.9MB/s. Absolute worst case scenario (no blocks in common)...
A-star (A*) Shortest Path Algorithm
Dijkstra shortest path algorithm.
The algorithm is based on the idea
that the next larger prime after one prime is the sum of the two smaller previous minus three prime numbers back.
For the first five prime numbers 2,3,5,7,11 this pattern is not true also it is not...
Floyd-Steinberg dithering is an image dithering algorithm (see http://en.wikipedia.org/wiki/Floyd-Steinberg for more details). While the algorithm is mainly for image manipulation, I use it to create random locations for sensor networt devices.
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.
|User Review for Five elements algorithm