Related papers: Optimal Competition Resolution Rule for Buslaev Co…
In this paper, we study joint queue-aware and channel-aware scheduling of arbitrarily bursty traffic over multi-state time-varying channels, where the bursty packet arrival in the network layer, the backlogged queue in the data link layer,…
Motivated by the ability of triangular spin ladders to implement quantum information processing, we propose a type of such systems whose Hamiltonian includes the XX Heisenberg interaction on the rungs and DzyaloshinskiiMoriya (DM) coupling…
This paper provides necessary conditions of optimality for optimal control problems with time delays in both state and control variables. Different versions of the necessary conditions cover fixed end-time problems and, under additional…
In a Hilbert space, we propose a class of general mixed-order primal-dual dynamical systems with Tikhonov regularization for a convex optimization problem with linear equality constraints. The proposed dynamical system is characterized by…
We consider the problem of controlling a Markov decision process (MDP) with a large state space, so as to minimize average cost. Since it is intractable to compete with the optimal policy for large scale problems, we pursue the more modest…
The average time required for an open quantum system to reach a steady state (the steady-state time) is generally determined through a competition of coherent and incoherent (dissipative) dynamics. Here, we study this competition for a…
In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined…
The optimal runtime of a quantum computer searching a database is typically cited as the square root of the number of items in the database, which is famously achieved by Grover's algorithm. With parallel oracles, however, it is possible to…
We introduce a simple dynamical rule in which each particle locates a particle that is farthest from it and moves towards it. Repeated application of this algorithm results in the formation of unusual dynamical patterns: during the process…
We consider a system of N particles with a stochastic dynamics introduced by Brunet and Derrida. The particles can be interpreted as last passage times in directed percolation on {1,...,N} of mean-field type. The particles remain grouped…
We consider the problem of sequential decision making under uncertainty in which the loss caused by a decision depends on the following binary observation. In competitive on-line learning, the goal is to design decision algorithms that are…
Probing the ability of automata networks to solve decision problems has received a continuous attention in the literature, and specially with the automata reaching the answer by distributed consensus, i.e., their all taking on a same state,…
A Boolean control network (BCN) is a discrete-time dynamical system whose variables take values from a binary set $\{0,1\}$. At each time step, each variable of the BCN updates its value simultaneously according to a Boolean function which…
We analyze the continuous time evolution of a $d$-dimensional system of $N$ self propelled particles with a kinematic constraint on the velocities inspired by the original Vicsek's one \cite{VCB-JCS}. Interactions among particles are…
The density classification problem is the computational problem of finding the majority in a given array of votes in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density…
This article solves an optimal control problem arising in attitude control of a spacecraft under state and control constraints. We first derive the discrete-time attitude dynamics by employing discrete mechanics. The orientation transfer,…
A stochastic birth-death competition model for particles with excluded volume is proposed. The particles move, reproduce, and die on a regular lattice. While the death rate is constant, the birth rate is spatially nonlocal and implements…
A model of Brownian particles with the ability to take up energy from the environment, to store it in an internal depot, and to convert internal energy into kinetic energy of motion, is discussed. The general dynamics outlined in Sect. 2 is…
We analyze the quantum dynamics of a non-relativistic particle moving in a bounded domain of physical space, when the boundary conditions are rapidly changed. In general, this yields new boundary conditions, via a dynamical composition law…
We study finite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction which…