Code Directory
 Visual Basic & VB.NET
New Code
VintaSoft Imaging .NET SDK 8.3
Devart ODBC Driver for InterBase 1.2
Devart ODBC Driver for PostgreSQL 1.2
Magento One Step Checkout Extension 0.1.1
Devart ODBC Driver for MySQL 1.2
Devart ODBC Driver for SQL Server 1.2
VirtualTable component 9.6
Review Assistant 3.0
Devart ODBC Driver for Oracle 1.2
DAC for MySQL 3.0.0
Penny Auction Software 3.1
Blasting Fax Server
YetiShare - Professional File Upload Script 4.2
MLM Forced Matrix Plan Software 1.0.2
Exe Guarder 4.1345
Top Code
dbForge Studio for SQL Server Express 5.0
Image Editor Using JavaFX 1.0
Sine Wave Using JavaFX 1.0
Animation Demo JavaFX 1.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
Quick Maintenance and Backup for MS SQL
ATN Resume Finder 2.0
ATN Site Builder 3.0
Bus Booking Script 1.0.4
Time Slot Booking Calendar PHP 1.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
WeBuilder 2015 13.3
Top Search
Code To Add Url
E Shop Php Sql
Website Value
Carpooling Website Php
Photo Add Comment Php
Free Html Projects
Guestbook Reviews
Video Sharing Project
Php Guestbook Spam
Guestbook In Php
Dirty Word
Twitter Update Script Php
Compiler Design Viva Questions And Answers
Photo Gallery Comment Php
Air Short Gamejava
Related Search
Mppt Algorithm
Mppt Algorithm Using Artificial Neural Network
Vhdl Code For Mppt Algorithm
Mppt Algorithm Using Ann
Mppt Algorithm In Matlab
Mppt Algorithm Code Fro Pv
Mppt Algorithm Source Codes
Spv Efficency Improvement Mppt Algorithm
Mppt Algorithm Codes And Scripts
Mppt Algorithm Code For Pv
Mppt Algorithm Codes
Mppt Algorithm Source Code
Mppt Algorithm Source Code For Matlab
Fuzzy Logic Algorithm Of Mppt
Cpu Algorithm
 Mppt Algorithm 

Code 1-20 of 60   Pages: Go to  1  2  3  Next >>  page  

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.


isPrime --> n: number to check if it is prime
allPrimes --> n: size of list of random primes, m: the primes in the list will be between 0 and m

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

NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems,...

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

The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm....

A flexible implementation of PSO algorithm with time-varying parameters. Algorithm is suitable for solving continuous optimization problems. Special care has been taken to enable flexibility of the algorthm with respect to its parameters and to...

findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).
An independent set of a graph is a subset of vertices in which no two vertices are
adjacent. Given a set of vertices, the maximum independent set...

We use the genetic algorithm (gatool) to determine the four parameters of the implicit Forst-Kalkwarf-Thodos Model. Predictions are in perfect agreement with data of vapour pressure of iodobenzene versus temperature for a temperature range from...

This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm). The new version (V2.2)is about 1.5 times faster than the old version (V2.1). It can solve a 1000 x 1000 problem in about 20 seconds in a...

This algorithm will accept a Latitude, Longitude and Altitude location as well as a specific universal coordinated time. It will use this information and calculate the position of the moon in a local coordinate frame (az and alt aka az and el).

This algorithm deal with multimodal optimization problems under constraints.

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

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.

SpeedyGA is a vectorized implementation of a genetic algorithm in the Matlab programming language. Without bells and whistles, it faithfully implements the specification for a Simple GA given on pgs 10, 11 of M. Mitchell's GA book. See comments in...

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.