Code Directory
 Visual Basic & VB.NET
New Code
GetOrgChart 2.4.0
iTech Car Sell Script 2.03
ByteScout PDF Renderer SDK
Install Package IronOcr 4.1.1
Bandcamp Clone Script 1.0
Library Management System 1.0
Password Sharing System 1.0
dbForge Monitor 1.0
Notes Management 1.0
Gantt Control VCL 3.0
Expense Management System 1.0
SOUNDIFY iTunes Clone 1.0
Advance Airbnb Clone Script 1.0.1
Bytescout BarCode Reader SDK
IP2Location Geolocation Database 2017
Top Code
Get Random Record Based on Weight 1.0.0
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
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
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Readymade MLM Software 2.02
Availability Booking Calendar PHP 1.0
Top Search
Code To Add Url
Photo Add Comment Php
Product Cipher
Twitter Update Script Php
Photo Gallery Comment Php
Dirty Word
Duplicate Bill Of Electricity Of Best In Mumbai
C Code For Ricart Agrawala Algo
Nuke Guestbook
Lane Detection
Screen Layout
Contoh Program Registrasi Dalam Java
Falling Down Game
Hilbert Transform C
Minimum Set Cover Problem Java
Related Search
Find S Algorithm
Dijkstras S Algorithm
Banker S Algorithm
Banker S Algorithm Deadlock Handling
Dijakstra S Algorithm
Hit S Algorithm
S Des Algorithm
S Box Substitution In Des Algorithm In C Language
Find Shortest Path Algorithm In Vbnet Source Code
Dijkstras Algorithm To Find The Shortest Path
Code Of S Des Algorithm
Painters Algorithm S Source Code
Truth Find Algorithm
S Aes Algorithm
To Find Shortest Path Using Genetic Algorithm
 Find S Algorithm 

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

This function do the Euclid's algorithm. As a matter of fact, for two given polynomials n, m (which are the polynomials of the symbolic
variable "s") it gives two other polynomials x, y such that nx+my=1.

Implementation of Valiaho's algorithm to determine the handicap based on paper

H. Valiaho. Determining the handicap of a sufficient matrix. Linear Algebra and Its Applications, 253:279-298, 1997.

This is a GUI for DTMF generator-decoder using Goertzel's algorithm.Has options to change Number of samples and Noise power that could be added at the generator.Suggestions and comments is always welcome.Now i am working on medical image pattern...

Solves the linear least squares problem with nonnegative variables using the newton's algorithm in:
Portugal, Judice and Vicente, A comparison of block pivoting and interior point algorithms for linear least squares problems with nonnegative...

Kruskal's algorithm is used to find the branches of a ''tree'' having the minimum weight in a system of branches. The application of this algorithm is wide. One example is in finding the shortest (and cheapest) path of interconnecting several...

DIJKSTRA Calculate Minimum Costs and Paths using Dijkstra's Algorithm

[AorV] Either A or V where
A is a NxN adjacency matrix, where A(I,J) is nonzero if and only if an edge connects point I to point J

Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected un directed weighted graph

The zip file contains

kruskal.m iscycle.m fysalida.m connected.m

If we want to find...

Implementation of a Reed-Solomon decoder using RiBM, Chien search, and modified Forney's algorithm.

RiBM algorithm: (Reformulated inversionless Berlekamp-Massey) see "High-Speed Architectures for Reedd-deOCtSolomon Decoders"...

CiviCluster's algorithm is now built into CiviCRM 1.8.

CiviCluster provides duplicate detection and merging functionality to CiviCRM in the form of a block that displays likely duplicates and links to the merging utility. While this...

This tutorial teaches you how to run the Horner's algorithm, for number convertion. It converts numbers from specified numeric system into decimal, without using powers, which makes the whole process faster.

This code snippet is the implementation of Dijkstra's algorithm.

An implementation of Butcher's Algorithm for determining the date of Easter for the Western church. Works for any date in the Gregorian calendar (1583 and onward). Returns a date object.

Globalmin is a very simple m-code which implements the very efficient Brent's algorithm.
It looks like fminbnd without any options and finds with a guaranteed precision a global minimum of a function under bounds constraints.
This goal...

This little function computes the date of Easter Sunday for present year or specific years, using Oudin's algorithm. It works for the entire Julian calendar (starting 325 AD) and Gregorian calendar (after 1583 AD).

Easter day is usefull...

The Peach Validator is a small program used verify the application of the Lhun's algorithm to s.i.n numbers. This program is designed to offer some insight into writting program wrappers or GUI applications with python.

Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, JA?nger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built...

This function is based on Yen's k-Shortest Path algorithm (1971)
It retuns:
1) [shortestPaths]: the list of K shortest paths (in cell array 1xK)
2) [totalCosts] : costs of the K shortest paths (in array 1xK)
Yen's algorithm...

Function to generate soundex code for any string (usually a name). Conforms to Knuth's algorithm and the common Perl implementation.

Implementation of Nicholas J. Higham's algorithm "Computing the Nearest Correlation Matrix - A Problem from Finance", 2002.

The function's algorithm uses Gaussian integer factorization and variable precision integers.