Sciweavers

6315 search results - page 460 / 1263
» Approximating Solution Structure
Sort
View
AMC
2005
168views more  AMC 2005»
15 years 7 months ago
Comparison between the homotopy analysis method and homotopy perturbation method
In this paper, we show that the so-called ``homotopy perturbation method'' is only a special case of the homotopy analysis method. Both methods are in principle based on...
Shijun Liao
TNN
2008
82views more  TNN 2008»
15 years 7 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...
TR
2008
117views more  TR 2008»
15 years 7 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
MOC
2000
124views more  MOC 2000»
15 years 7 months ago
Local and parallel finite element algorithms based on two-grid discretizations
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
Jinchao Xu, Aihui Zhou
ML
2002
ACM
146views Machine Learning» more  ML 2002»
15 years 7 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio