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
Easy CSS Menu 5.0
Bytescout PDF SDK 1.7.0.222
Kickstarter clone script 2.0.5
Indiegogo Clone 3.0
Mercato 1.0
Readymade PHP Classified Script 3.3
Udacity Clone Script 1.20
PHP News Script 1.0.5
Exe Guarder 4.14
dbForge Search 2.2
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
Top Code
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
Top Search
Code To Add Url
Photo Add Comment Php
Twitter Update Script Php
Photo Gallery Comment Php
Dirty Word
Gallery Comment
Contoh Program Registrasi Dalam Java
Free Html Projects
User Activation Signup Email Activation
Article Directory Script For Wordpress
German Guestbook
Html Project On Pollution
Nuke Guestbook
Free Prepaid Electricity Meter Generator Download
Flat File Php Guestbook
Related Search
Truth Finder Algorithm
Truth Finder Algorithm For Java Projects
Source Code Of Truth Finder Algorithm
Truth Finder Algorithm Code
Truth Finder
Source Code For Truth Finding Algorithm
Truth Finder Code
Truth Find Algorithm
Truth Finder In Conflicting Web Information
Truth Finder With Multiple Conflicting Information
Java Pseudocode On Truth Finder
Truth Discovery Algorithm
Truht Finder Algorithm
Truth Finder Ppt
Cpu Algorithm
 Truth Finder 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.

Parameters:

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



The Day Name Finder allows you to find the name of the day from any date since January 1st, 1970. The script is compatible with all modern web browsers and is also very easy to install, use and customize.

The javascript file size is...



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.
ACO('filename.tsp');



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