Results 11 to 20 of about 656,245 (262)
Optimal cost almost-sure reachability in POMDPs [PDF]
We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with ...
CHATTERJEE, K +3 more
openaire +3 more sources
Almost optimal algorithms for diameter-optimally augmenting trees
The paper has been accepted at the 29th International Symposium on Algorithms and Computation (ISAAC 2018).
openaire +5 more sources
Almost optimal adaptive LQ control: observed state case [PDF]
In this paper we propose an almost optimal indirect adaptive controller for input/state dynamical systems. The control part of the adaptive scheme is based on a modified LQ control law: by adding a time varying gain to the certainty equivalent control law we avoid the conflict between identification and ...
Polderman, Jan Willem +2 more
openaire +2 more sources
Optimal Dynamic Control of Proxy War Arms Support
A proxy war between a coalition of countries, BLUE, and a country, RED, is considered. RED wants to increase the size of the RED territory. BLUE wants to involve more regions in trade and other types of cooperation.
Peter Lohmander
doaj +1 more source
Constructions of optimal and almost optimal locally repairable codes [PDF]
5 pages ...
Toni Ernvall +2 more
openaire +2 more sources
This work proposes an approach for the optimal sizing of a cylindrical heaving wave energy converter (WEC). The approach is based on maximising the absorbed power density (APD) of the buoy, with the diameter being the decision variable. Furthermore, two
Ntumba Marc-Alain Mutombo +1 more
doaj +1 more source
Almost-Optimal Sublinear Additive Spanners
Given an undirected unweighted graph $G = (V, E)$ on $n$ vertices and $m$ edges, a subgraph $H\subseteq G$ is a spanner of $G$ with stretch function $f: \mathbb{R}_+ \rightarrow \mathbb{R}_+$, if for every pair $s, t$ of vertices in $V$, $\text{dist}_{H}(s, t)\le f(\text{dist}_{G}(s, t))$.
Zihan Tan, Tianyi Zhang
openaire +2 more sources
Application of the averaging method to the problems of optimal control of the impulse systems
The problem of optimal control at finite time interval for a system of differential equations with impulse action at fixed moments of time as well as the corresponding averaged system of ordinary differential equations are considered. It is proved the
T.V. Koval'chuk +3 more
doaj +1 more source
Distributed Interval Optimization Over Time-Varying Networks: A Numerical Programming Perspective
In this study, we investigate a distributed interval optimization problem involving agents linked by a time-varying network, optimizing interval objective functions under global convex constraints.
Yinghui Wang +3 more
doaj +1 more source
We construct a matrix $M\in R^{m\otimes d^c}$ with just $m=O(c\, \,\varepsilon^{-2}\text{poly}\log1/\varepsilon )$ rows, which preserves the norm $\|Mx\|_2=(1\pm\varepsilon)\|x\|_2$ of all $x$ in any given $ $ dimensional subspace of $ R^d$ with probability at least $1- $. This matrix can be applied to tensors $x^{(1)}\otimes\dots\otimes x^{(c)}\in
Ahle, Thomas D., Knudsen, Jakob B. T.
openaire +2 more sources

