Results 21 to 30 of about 2,095,948 (338)
Approximation by superpositions of a sigmoidal function
Math. Control. Signals Syst., 1989 In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set of affine functionals can uniformly approximate any continuous function ofn real variables with support in the unit hypercube; only ...
G. Cybenko
semanticscholar +1 more source
Ou comme ça, machin et autres marqueurs d’indétermination dans les listes
Discours, 2017 This article deals with two extension particles (or “general extenders”) found in the OFROM corpus (French spoken in Switzerland). On the one hand, we study the sequence ou comme ça (“or like that”), whose high frequency seems to be characteristic of the
Marie-José Béguelin +1 more
doaj +1 more source
Ultrafast Approximation for Phylogenetic Bootstrap
Molecular biology and evolution, 2013 Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck.
M. Bui, Minh Anh Nguyen, A. von Haeseler
semanticscholar +1 more source
Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
IEEE Transactions on Automatic Control, 1992 J C Spall
exaly +2 more sources
Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning [PDF]
Neural Networks, 2017 In recent years, neural networks have enjoyed a renaissance as function approximators in reinforcement learning. Two decades after Tesauro's TD-Gammon achieved near top-level human performance in backgammon, the deep reinforcement learning algorithm DQN ...
Stefan Elfwing, E. Uchibe, K. Doya
semanticscholar +1 more source
Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]
, 2009 Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka +4 more
core +1 more source
Advanced Engineering Research, 2017 Introduction. Prof A.V. Belokon’s (1941-2013; former Rector of Rostov State University and President of Southern Federal University) PhD thesis was devoted to asymptotical methods in contact problems of the elasticity theory for bodies of cylindrical ...
Dmitry A Pozharskii, Nikita B. Zolotov
doaj +1 more source
Advanced Engineering Research, 2014 A solution to the problem on describing experimentally obtained dependences is considered. The autho r’s method is based upon getting some local approximations of fragments of these relations, and their additive reduction to a single analytical ...
Rudolf Anatolyevich Neydorf
doaj +1 more source
Approximating Approximate Distance Oracles
CoRR, 2016 Given a finite metric space $(V,d)$, an approximate distance oracle is a data structure which, when queried on two points $u,v \in V$, returns an approximation to the the actual distance between $u$ and $v$ which is within some bounded stretch factor of the true distance.
Michael Dinitz, Zeyu Zhang 0003
openaire +4 more sources
Applied Categorical Structures, 2017 In a locally $λ$-presentable category, with $λ$ a regular cardinal, classes of objects that are injective with respect to a family of morphisms whose domains and codomains are $λ$-presentable, are known to be characterized by their closure under products, $λ$-directed colimits and $λ$-pure subobjects.
Jirí Rosický, Walter Tholen
openaire +4 more sources