Results 131 to 140 of about 1,967 (149)

ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers. [PDF]

Nat Commun
Chen Z, Xiao Z, Akl M, Leugering J, Olajide O, Malik A, Dennler N, Harper C, Bose S, Gonzalez HA, Samaali M, Liu G, Eshraghian J, Pignari R, Urgese G, Andreou AG, Shankar S, Mayr C, Cauwenberghs G, Chakrabartty S.   +19 more
europepmc   +1 more source

Hysteresis in cavitation emissions during a ramped-then-deramped amplitude sonication: A theoretical and experimental investigation. [PDF]

Nonlinear Dyn
Zhang Y, Li S, Prentice P, Cammarano A.
europepmc   +1 more source

Network flow-control using asynchronous stochastic approximation [PDF]

2007 46th IEEE Conference on Decision and Control, 2007
We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion ...
Shalabh Bhatnagar
exaly   +5 more sources

The Borkar–Meyn theorem for asynchronous stochastic approximations [PDF]

Systems and Control Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shalabh Bhatnagar
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Asymptotic behavior of asynchronous stochastic approximation

Science in China Series F: Information Sciences, 2001
The pathwise convergence of a distributed, asynchronous stochastic approximation (SA) scheme is analyzed. The conditions imposed on the step size and noise are the weakest in comparison with the existing ones. The step sizes in different processors are allowed to be different, and the time-delays between processors are also allowed to be different and ...
Haitao Fang, Fang Haitao, Chen Hanfu
exaly   +2 more sources

Asynchronous Stochastic Approximation Algorithms for Networked Systems: Regime-Switching Topologies and Multiscale Structure

Multiscale Modeling and Simulation, 2013
The paper develops consensus algorithms under the asynchronous communication and random computation environments. Consensus problems are related to control applications that involve coordination of multiple entities with only limited neighborhood information to reach a global goal for the entire team.
G Yin, Le Yi Wang
exaly   +2 more sources

Asynchronous distributed principal component analysis using stochastic approximation

2012 IEEE 51st IEEE Conference on Decision and Control (CDC), 2012
In this paper we address the problem of asynchronous distributed principal component analysis. We provide several algorithms coping with different situations according to the underlying graph structure. A general enough framework allows us to analyze all these algorithms at the same time.
Pascal Bianchi, Jeremie Jakubowicz
exaly   +2 more sources

Asynchronous stochastic approximation and adaptation in a competitive system

1999
exaly   +5 more sources

The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning [PDF]

SIAM Journal on Control and Optimization, 2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergence of the algorithm. Several specific classes of algorithms are considered
V S Borkar, S P Meyn
exaly   +3 more sources

Centralized and decentralized asynchronous optimization of stochastic discrete-event systems [PDF]

IEEE Transactions on Automatic Control, 1998
We propose and analyze centralized and decentralized asynchronous control structures for the parametric optimization of stochastic Discrete Event Systems (DES) consisting of K distributed components. We use a stochastic approximation type of optimization
F J Vázquez-Abad, Christos G Cassandras   +1 more
exaly   +1 more source