Results 221 to 230 of about 5,139 (262)

Quantifying the shape of cells, from Minkowski tensors to p-atic orders. [PDF]

Elife
Happel L, Oberschelp G, Grudtsyna V, Jain HP, Sknepnek R, Doostmohammadi A, Voigt A.   +6 more
europepmc   +1 more source

Deconstruction of the Anisotropic Magnetic Interactions from Spin-Entangled Optical Excitations in van der Waals Antiferromagnets. [PDF]

Adv Sci (Weinh)
Jana D, Acharya S, Orlita M, Faugeras C, Pashov D, van Schilfgaarde M, Potemski M, Koperski M.   +7 more
europepmc   +1 more source

A systematic study of the NaMnAs half-Heusler compound from bulk to (001) surfaces as promising spintronic materials. [PDF]

RSC Adv
Ha CV, Keovongsa S, Reyes-Serrato A, Guerrero-Sanchez J, Hoat DM.   +4 more
europepmc   +1 more source

Behavioral Time Scale Synaptic Plasticity (BTSP) endows binding of distributed representations with flexible retrieval options

Yu C, Yang Y, Wu Y, Wang A, Maass W.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Classification-Based Approximate Policy Iteration

IEEE Transactions on Automatic Control, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farahmand, Amir-Massoud, Precup, Doina, Barreto, André M. S., Ghavamzadeh, Mohammad   +3 more
openaire   +3 more sources

Approximation and Iteration

1970
For practical purposes, it is often necessary to work out a good estimate of the value of a function f: I ↔ ℝ at each x ∈ I. One method is to use the Taylor expansion with integral form of the remainder, as follows. Let I = ⩾p, q⩽ suppose f ∈ 𝒞n + 1 (I) (see 29.6), and 0 ∈ .
H. B. Griffiths, P. J. Hilton
openaire   +1 more source

Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations

International Journal of Computational Methods, 2021
Linear equation solvers require considerable computational time in many computer simulation methods, such as the stress analysis using the finite element method (FEM), or the fluid dynamics using an implicit time integration scheme. Because of their favorable nature to modern supercomputers, Krylov-type linear equation solvers have become dominant ...
Noriyuki Kushida, Hiroshi Okuda
openaire   +1 more source

Iterated approximate value functions

2013 European Control Conference (ECC), 2013
In this paper we introduce a control policy which we refer to as the iterated approximate value function policy. The generation of this policy requires two stages, the first one carried out off-line, and the second stage carried out on-line. In the first stage we simultaneously compute a trajectory of moments of the state and action and a sequence of ...
Brendan O'Donoghue, Yang Wang, Stephen Boyd   +2 more
openaire   +1 more source

Iterated Approximate Moving Least Squares Approximation

2007
The radial basis function interpolant is known to be the best approximation to a set of scattered data when the error is measured in the native space norm. The approximate moving least squares method, on the other hand, was recently proposed as an efficient approximation method that avoids the solution of the system of linear equations associated with ...
Gregory E. Fasshauer, Jack G. Zhang
openaire   +1 more source

Deep approximate policy iteration

The Annals of Statistics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiao, Yuling, Kang, Lican, Liu, Jin, Lu, Xiliang, Yang, Jerry Zhijian   +4 more
openaire   +2 more sources