A demo program of image edge detection using ant colony optimization.
This is a demo program of the paper Ant colony optimization for wavelet-based image interpolation using a three-component exponential mixture model," Expert Systems with Applications, Vol. 38, No. 10, Sept. 2011, pp. 12514-12520.
This is a demo program of the paper L. Ma, J. Tian, and W. Yu, "Visual saliency detection in image using ant colony optimisation and local phase coherence," Electronics Letters, Vol. 46, Jul. 2010, pp. 1066-1068.
This is a demo program of the paper J. Tian, W. Yu, and L. Ma, "AntShrink: Ant colony optimization for image shrinkage," Pattern Recognition Letters, Vol. 31, Oct. 2010, pp. 1751-1758.
Simple POSIX multithread Ant Colony Optimizer framework currently for solving Vehicle Routing Problem. Supports UDP, file synchronizatoin between computers.
In this M-file, the implementation of ACO Algorithm is given with the support of reference papers listed. You can easily use it as following command to see the pictures of result and the playing iterative course. ACO('filename.tsp');
Dynamic job shop scheduling problem is one form of a job shop scheduling problem with varying arrival time job or not concurrent. This problem can be represented in graph form, which is to seek the shortest path from start point to destination...
These files are the MATLAB code for "Imperialist Competitive Algorithm (ICA)" which in some papers is referred by "Colonial Competitive Algorithm CCA".
Evolutionary optimization methods, inspired from natural...
This software contains one example taken from the reference paper given with this program..By running the file P1.m as they are in the default ABC-eld folder the economic dispatch problem can be solved. The allocation minimum fuel cost and...
Evolutionary optimization methods, inspired from natural processes, have shown good performance in solving complex optimization problems. For example, genetic algorithms (inspired from biological evolution of human and other species), ant colony...
here is m-files for tsp problem .it is well written with good descriptions.and works even for large number of nodes.
MAX-MIN Ant System was supposed to work better than AS and ACS.In this M-file, MMAS Algorithm is implemented, it can be easily used as following command to see the playing iterative course. ACO('filename.tsp'); here filename.tsp is the...
Lost your VBA Password? Former employees left without unprotecting their documents? Unable to access your important document? Forgot your password? Crack it down using VBA Recovery! VBA Recovery is a password recovery tool for VBA modules embedded...
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.
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.
This is a simple implementation of the famous LZW algorithm.
this algorithm predicts the received signal strength for the mobile user to avoid fluctuation in received signal strength during localization of the mobile user(finding mobile user's location) |