Results 71 to 80 of about 1,967 (149)

Non-orthogonal Multiple Access (NOMA) with Asynchronous Interference Cancellation [PDF]

, 2015
Non-orthogonal multiple access (NOMA) allows allocating one carrier to more than one user at the same time in one cell. It is a promising technology to provide high throughput due to carrier reuse within a cell.
Haci, Huseyin
core  

A Refined Mean Field Approximation for Synchronous Population Processes [PDF]

, 2018
International audienceMean field approximation is a popular method to study the behaviour of stochastic models composed of a large number of interacting objects. When the objects are asynchronous, the mean field approximation of a population model can be
Gast, Nicolas, Massink, Mieke, Latella, Diego   +2 more
core   +1 more source

DASA: Delay-Adaptive Multi-Agent Stochastic Approximation [PDF]

We consider a setting in which $N$ agents aim to speedup a common Stochastic Approximation (SA) problem by acting in parallel and communicating with a central server.
Kulkarni, Sanjeev R., Mitra, Aritra, Pappas, George J., Fabbro, Nicolò Dal, Poor, H. Vincent, Adibi, Arman   +5 more
core   +1 more source

Stochastic Approximation Methods for Systems Over an Infinite Horizon [PDF]

, 1996
The paper develops efficient and general stochastic approximation (SA) methods for improving the operation of parametrized systems of either the continuous- or discrete-event dynamical systems types and which are of interest over a long time period.
Kushner, Harold J., Vázquez-Abad, Felisa   +1 more
core   +1 more source

Stochastic Approximation Algorithms With Applications To Particle Swarm Optimization, Adaptive Optimization, And Consensus [PDF]

, 2015
In this dissertation, we present three problems arising in recent applications of stochastic approximation methods. In Chapter 2, we use stochastic approximation to analyze Particle Swarm Optimization (PSO) algorithm.
Yuan, Quan
core   +1 more source

Distributed asynchronous stochastic approximation algorithms with unbounded stochastic information delays - theory and applications

Part I of this thesis studies the stability and convergence of distributed stochastic approximation (SA) algorithms affected by age-of-information (AoI). The main result is a generalization of Borkar and Meyn's SA stability theorem to distributed SA algorithms, previously known only for bounded AoI processes.
openaire   +2 more sources

Stochastic approximation for consensus: A new approach via ergodic backward products [PDF]

, 2012
—This paper considers both synchronous and asyn-chronous consensus algorithms with noisy measurements. For stochastic approximation based consensus algorithms, the existing convergence analysis with dynamic topologies heavily relies on quadratic Lyapunov
Minyi Huang
core  

Bayesian Modal Identification using Asynchronous Ambient Data [PDF]

Operational modal analysis (OMA) has been used nowadays for identifying the modal properties of structures (e.g., natural frequencies, damping ratios and mode shapes) based on the measured ambient vibration data for its high economy and efficiency.
Zhu, Y
core   +1 more source

A two-level stochastic approximation for admission control and bandwidth allocation [PDF]

, 2000
In an access node to a multiservice network [e.g., a base station in an integrated services cellular wireless network or the optical line terminal (OLT) in a broad-band passive optical network (PON)], the output link bandwidth is adaptively assigned ...
MARYNI P., DAVOLI, FRANCO
core  

On the Existence of Markov Perfect Equilibria in Perfect Information Games [PDF]

We study the existence of pure strategy Markov perfect equilibria in two-person perfect information games. There is a state space X and each period player's possible actions are a subset of X.
Hannu Vartiainen, Hannu Salonen
core