Results 261 to 270 of about 57,258 (313)

Secant Optimization Algorithm for efficient global optimization. [PDF]

Sci Rep
Ibrahim MQ, Qaraad M, Hussein NK, Farag MA, Guinovart D.   +4 more
europepmc   +1 more source

Analysis of delay differential equations with dual caputo-type fractional derivatives using laplace transform methods. [PDF]

Sci Rep
Boumaaza M, Boutiara A, Djidel O, Guefaifia R, Boulaaras S.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Local Function Approximation in Evolutionary Algorithms for the Optimization of Costly Functions

IEEE Transactions on Evolutionary Computation, 2004
We develop an approach for the optimization of continuous costly functions that uses a space-filling experimental design and local function approximation to reduce the number of function evaluations in an evolutionary algorithm. Our approach is to estimate the objective function value of an offspring by fitting a function approximation model over the k
Rommel G Regis
exaly   +2 more sources

A Randomized Algorithm for Multivariate Function Approximation

SIAM Journal on Scientific Computing, 2017
Summary: The randomized Kaczmarz (RK) method is a randomized iterative algorithm for solving (overdetermined) linear systems of equations. In this paper, we extend the RK method to function approximation in a bounded domain. We demonstrate that by conducting the approximation randomly one sample at a time the method converges.
Yeonjong Shin, Dongbin Xiu
openaire   +1 more source

An incremental learning algorithm for function approximation

Advances in Engineering Software, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bahi, Jacques, Contassot-Vivier, Sylvain, Sauget, Marc   +2 more
openaire   +3 more sources

Residual Sarsa algorithm with function approximation

Cluster Computing, 2017
In this work, we proposed an efficient algorithm named the residual Sarsa algorithm with function approximation (FARS) to improve the performance of the traditional Sarsa algorithm, and we use the gradient-descent method to update the function parameter vector. In the learning process, the Bellman residual method is adopted to guarantee the convergence
Qiming Fu 0001, Wen Hu, Quan Liu 0004, Heng Luo, Lingyao Hu, Jianping Chen   +5 more
openaire   +1 more source

Approximation algorithm for (connected) Italian dominating function

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ke Li, Zhao Zhang 0002
openaire   +1 more source