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
Softros LAN messenger 9.2
GetOrgChart 2.5.2
Alvas.Audio 2018.0
Bytescout PDF Viewer SDK 9.0.0.3079
SecureBridge 8.2
Magento Language Translator 1.0
Australia Post Shipping For Magento 1.0
Excel Add-in for SQL Server 1.7
ODBC Driver for BigCommerce 1.3
Excel Add-in for SQLite 1.7
SentiVeillance SDK Trial 6.0.183849
dotConnect for Dynamics CRM 1.7
Entity Developer 6.3
dbForge Documenter for Oracle 1.0
dbForge Data Generator for Oracle 2.0
Top Code
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
Advanced MLM Software 1.2
Online Food Ordeing System 1.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
PHP Point of sale 10.0
Travel Portal Script 9.29
Excel Add-in for Bigcommerce 1.6
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Top Search
Code To Add Url
Flat File Php Guestbook
Twitter Update Script Php
Dirty Word
Scholarship Management System
Guestbooks Aspnetindex
Triangle In C Program Code Example
Gallery Comments
Php Banner Traffic Tracking
Php Phone Directory
Sample Script For An Badminton Tournament
Lwip Snmp
Triangle Rotation Program In C
Photo Add Comment Php
Mini Projects On Web Technology
Related Search
Enhance Second Chance Algorithm
Second Chance Algorithm Code
Second Chance Algorithm Source Code
Second Chance Algorithm
Enhance Second Chance
Enhanced Second Chance Algorithm
Second Chance Page Replacement Algorithm
Second Chance Replacement Algorithm
Second Chance Page Algorithm
Second Chance Page Algorithm Simulation
Second Chance
Code Of Second Chance
C Code For Second Chance Page Replacement
Enhanced Second Chance Pra
Enhanced Second Chance Page Replacement
 Enhance Second Chance Algorithm 

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






There are two stages in our experiments, one is to find the predicted values of the signal strengths (RSSId-deOaos) by using Grey prediction algorithm and second is to find the location coordinate of the mobile user by using Dynamic Triangular Location method. We have used grey prediction to predict the tendency of RSSI at rum-time stage and present analysis of predicted RSSI when mobile user is moving. Grey perdition is able to reduce the...



The native unique works using the sortrows algorithm which can be very slow for large models.

Sometimes we need to avoid passing multiple values to functions that do not support those.
In most of these cases we are pretty sure that...



Second Copy 2000 is the perfect backup product you have been looking for. It makes a backup of your data files to another directory, disk or computer across the network. It then monitors the source files and keeps the backup updated with new or...



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)



EDFT (Extended Discrete Fourier Transform) algorithm produces N-point DFT of sequence X where N is greater than the length of input data. Unlike the Fast Fourier Transform (FFT), where unknown readings outside of X are zero-padded, the EDFT...



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.