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
A New Capacity-Achieving Private Information Retrieval Scheme With (Almost) Optimal File Length for Coded Servers [PDF]
In a distributed storage system, private information retrieval (PIR) guarantees that a user retrieves one file from the system without revealing any information about the identity of its interested file to any individual server.
Jinbao Zhu +3 more
semanticscholar +1 more source
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
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
Explicit measurements with almost optimal thresholds for compressed sensing [PDF]
We consider the deterministic construction of a measurement matrix and a recovery method for signals that are block sparse. A signal that has dimension N = nd, which consists of n blocks of size d, is called (s, d)-block sparse if only s blocks out ...
Hassibi, Babak, Parvaresh, Farzad
core +1 more source
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
Adaptive BEM with inexact PCG solver yields almost optimal computational costs [PDF]
We consider the preconditioned conjugate gradient method (PCG) with optimal preconditioner in the frame of the boundary element method for elliptic first-kind integral equations.
T. Führer +3 more
semanticscholar +1 more source
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels [PDF]
Consider a binary linear code of length $N$, minimum distance $d_{\min}$, transmission over the binary erasure channel with parameter $0 < \epsilon < 1$ or the binary symmetric channel with parameter $0 < \epsilon < \frac{1}{2}$, and block-MAP decoding ...
Hamed Hassani +4 more
semanticscholar +1 more source
Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables [PDF]
In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number of variables ...
Xiao, GuoZhen, Zhang, WeiGuo
core +3 more sources

