* To find a solution to the equation f(x) = 0
* given initial approximations p0 and p1:
* INPUT: initial approximation p0, p1; tolerance TOL;
* maximum number of iterations N0.
* OUTPUT: approximate solution... AlgorithmC++
Graphs are a more general structure than the trees we studied in the last chapter; in fact you can think of a tree as a special kind of graph. Graphs can be used to represent many interesting things about our world, including systems of roads, airline flights from city to city, how the Internet is c... AlgorithmC++
Assign an ordering A1;:::;An to the nonterminals of the grammar.
for i := 1 to n do begin for j := 1 to i 1 do begin for each production of the form Ai ! Aj do begin remove Ai ! Aj from the grammar for each production of the form Aj ! do begin add Ai ! to the grammar end end end transform th... AlgorithmC
the project contain the security algorithm Md5 hash code in verilog. in communication system this used as a security measure for encryption and decryption of message or information.... AlgorithmVerilog
Its a simple one file code for displaying a simulation of the First Come First Serve algorithm (FCFS) in C language.
A terminal application who need as an inputs:
The number of processes.
The properties of each process (Name, serving and arrival time).
To fin... AlgorithmC
Hadoop Base K-Means algorithm
November 29, 2013. Now we release ankus 0.1!
New features of ankus 0.1
1) Classification - ID3
2) Clustering - EM
3) Similarity - Content based Similarity
4) Recommendation System - Item based recommendation
5) Recommendation ve... AlgorithmJava
TO FACTOR THE POSITIVE DEFINITE N BY N MATRIX A INTO LL**T,
WHERE L IS LOWER TRIANGULAR.
INPUT: THE DIMENSION N; ENTRIES A(I,J), 1<=I, J<=N OF A.
OUTPUT: THE ENTRIES L(I,J), 1<=J<=I, 1<... AlgorithmFortran
TO OBTAIN THE COEFFICIENTS OF THE HERMITE INTERPOLATING
POLYNOMIAL H ON THE (N+1) DISTINCT NUMBERS X(0),...,X(N)
FOR THE FUNCTION F:
INPUT NUMBERS X(0), X(1),..., X(N); VALUES F(X(0)), F(X(1)),...,
O FACTOR THE POSITIVE DEFINITE N BY N MATRIX A INTO LDL**T,
WHERE L IS A LOWER TRIANGULAR MATRIX WITH ONES ALONG THE DIAGONAL
AND D IS A DIAGONAL MATRIX WITH POSITIVE ENTRIES
ON THE DIAGONAL
INPUT: T... AlgorithmFortran
TO APPROXIMATE I = INTEGRAL((F(X) DX)) FROM A TO B:
INPUT: ENDPOINTS A, B; INTEGER N.
OUTPUT: AN ARRAY R. ( R(2,N) IS THE APPROXIMATION TO I.)
R IS COMPUTED BY ROWS; ONLY 2 ROWS SAVED IN STORAGE... AlgorithmFortran