Source Code Online Home Categories Top Code New Code Submit Code
Code Directory
 Visual Basic & VB.NET
New Code
Faxmind Server
Virto Cross Site and Cascaded Look up 3.0.0
Fax Server Pro 9.1.1021
Video Sharing Script 3.0
SQL Server Data Access Components 7.0 Beta
Joyfax Server 10.42.1020
Virto SharePoint Resource Gantt Web Part 2.1.0
Social Media Script 3.0
Social Network Script 3.0
Meta Tag Assistant 1.0
BoxedApp Packer
Freelance Script 3.0
Indeed Clone 3.0
Job Portal Script by NCrypted 3.0
Top Code
Freelance Script 3.0
Indeed Clone 3.0
Job Portal Script by NCrypted 3.0
SoundCloud Clone 3.0
Netflix Clone 3.0
Hulu Clone 3.0
Facebook Clone 3.0
DTM Data Generator for JSON 1.00.01
OpenWire Studio Beta2
SignalLab VC++ 5.0.3
PlotLab VC++ 5.0.3
InstrumentLab VC++ 5.0.3
BasicVideo VC++ 5.0.3
Contest Software - Agriya v2.0b2
AudioLab VC++ 5.0.3
Top Search
Source Code Of Add Comment In Php
Photo Add Comment Php
Comments And Ratings
Add Comment Script
Guestbook Flat
Guestbook Captcha
Php Guestbook Submit Picture
Carpooling Website Php
Php Guestbook Submit Pictureindex
Dirty Word
Php Online Exam Sourse Code
Php Guestbook With Search
Guestbook With Admin Php
Mobile Dialer Operator Code
Photo Gallery Comment Php
Related Search
Java Source Code For Ricart Agrawala Algorithm
Ricart Agrawala Algorithm
Ricart Agrawala
Ricart Agrawal Algorithm
Ricart Agrawala Program In Java
Ricart Agrawala Java
Ricart Agarwala Algorithm
Implementation Of Ricart Aggarwala Algorithm
Ricart Agrawala Alorithm
Ricart Agrawala Program
Implementation Ricart Agrawala
Ricart Agrawala Avec Thread
Ricart Agrawalas Algorithm
C Code For Ricart Agrawala Algo
Code For Ricart Agarwala Algorithm
 Ricart Agrawala 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.