CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
SourceCode
Mathimatics-Numerical algorithms
AI-NN-PR
Main Category
SourceCode
Web Code
Develop Tools
Document
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search in result
Search
AI-NN-PR list
Sort by :
«
1
2
...
.89
.90
.91
.92
.93
694
.95
.96
.97
.98
.99
...
2831
»
BP-neural-network
Downloaded:0
BP neural network (LM algorithm) to initialize the network prior to using simulation to improve before the network before the network BP algorithm training
Date
: 2025-08-22
Size
: 6kb
User
:
周挺挺
RVM1
Downloaded:1
this is a code of RVM, which can help the people who begin to study RVM
Date
: 2025-08-22
Size
: 2kb
User
:
lele
6e3921bc9da1
Downloaded:0
dstar auto
Date
: 2025-08-22
Size
: 33kb
User
:
chaoge
A-Start
Downloaded:0
Astart is china help
Date
: 2025-08-22
Size
: 94kb
User
:
Xillscar
Time-Series-Prediction-ANN
Downloaded:0
Using artificial neural networks for time series prediction.
Date
: 2025-08-22
Size
: 102kb
User
:
Amir
Pattern-Recognition-ANN
Downloaded:0
This file solves the pattern recognition algorithm using artificial neural networks.
Date
: 2025-08-22
Size
: 70kb
User
:
Amir
gauss_seidel
Downloaded:0
In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the G
Date
: 2025-08-22
Size
: 7kb
User
:
zineb24
methode_jacobie
Downloaded:0
In numerical linear algebra, the Jacobi method (or Jacobi iterative method[1]) is an algorithm for determining the solutions of a diagonally dominant system of linear equations. Each diagonal element is solved for, and a
Date
: 2025-08-22
Size
: 44kb
User
:
zineb24
resolution_chlesky
Downloaded:0
In linear algebra, the Cholesky decomposition or Cholesky factorization is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, useful for ef
Date
: 2025-08-22
Size
: 21kb
User
:
zineb24
triangularisation_sup
Downloaded:0
In the mathematical discipline of linear algebra, a triangular matrix is a special kind of square matrix. A square matrix is called lower triangular if all the entries above the main diagonal are zero. Similarly, a squar
Date
: 2025-08-22
Size
: 19kb
User
:
zineb24
resolution_gauss_rement
Downloaded:0
La méthode du pivot de Gauss est une méthode directe de résolution de système linéaire qui permet de transformer un système en un autre système équivalent échelonné. On résout le système ainsi obtenu à l’aide d’un algor
Date
: 2025-08-22
Size
: 8kb
User
:
zineb24
RBF-k-means
Downloaded:0
Based on RBF neural network program code K-means clustering!
Date
: 2025-08-22
Size
: 6kb
User
:
lkp
«
1
2
...
.89
.90
.91
.92
.93
694
.95
.96
.97
.98
.99
...
2831
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.