Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
EaseClouds Virtual File System SDK 2.1.1.2
dbForge SQL Decryptor 3.1
Fortune Gigs Script 2.03
Pricing Plans and Subscription Payment Script 1.0
PHP Image Resize Script 1.0
iTech Book Store Script 2.03
dbForge Event Profiler for SQL Server 1.3
iTech Question Answer Script 2.03
GZ Multi Hotel Booking System 1.0
iTech Video Tutorial Script 2.03
Uber App Clone 1.0
TeeChart NET for Xamarin.Forms 2017
JavaScript Framework Shield UI 1.7.33
SentiVeillance SDK Trial 6.0.171442
Instacart Clone 1.0
Top Code
StreamChat 6.6
latgsqr 1.0
TAdvPicture 1.2
JNAerator / NativeLibs4Java 1.0
Best Spotify Clone 1.0
Revenue Auto Pilot 1.0
PostDate 2.4.40
Top Rated
PHP Image Resize Script 1.0
Jango Clone Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Sine Wave Using JavaFX 1.0
ICPennyBid Penny Auction Script 4.0
Cuckoo Search (CS) Algorithm 1.0
File ID: 79825






Cuckoo Search (CS) Algorithm 1.0
Download Cuckoo Search (CS) Algorithm 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 829
User Rating:1 Stars  (1 rating)
Submit Rating:
Cuckoo Search (CS) Algorithm 1.0 Description
Description: 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.

License: Freeware

Related: and the, extended, called cuckoo, Easily, algorithm called, works unconstrained, unconstrained optimization, global optimization, code demonstrates, cs is, unconstrained, fully implemented, given here, Works, cuckoo search, demonstrates

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 829



More Similar Code

ICP - Iterative Closest Point algorithm, c++ implementation. Handles only points in R^3. Makes use of a kd-tree for closest-point search. ICP finds the transformation of points in data to fit points in model. Fit with respect to minimize a weighted sum of squares for distances between the data points and the corresponding closest model points.



Drupal 7 note: The development version for Drupal 7.x is working! If you don't see the development version available below, check back in about 24 hours (or check it out from HEAD in CVS). Check issue #674064: Drupal 7 version of Porter Stemmer to...



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...



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...



This is an application of the Greedy Algorithm and the Local Search for finding a solution for the SC Distribution Network problem.
We dealt with one level SC composed of a set of factories and a set of Sales Points, each sales point has a...



A few popular metaheuristic algorithms are included, such as the particle swarm optimization, firefly algorithm, harmony search and others.



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...



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.

User Review for Cuckoo Search (CS) Algorithm
- required fields
     

Please enter text on the image