Results 21 to 30 of about 701,199 (295)
CoRR, 2019 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-δ$.
Thomas D. Ahle, Jakob Bæk Tejs Knudsen
openaire +2 more sources
Almost-Optimal Sublinear Additive Spanners
SIAM Journal on Computing, 2023 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
Optimal Dynamic Control of Proxy War Arms Support
Automation, 2023 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
Almost optimal algorithms for diameter-optimally augmenting trees
Theoretical Computer Science, 2022 The paper has been accepted at the 29th International Symposium on Algorithms and Computation (ISAAC 2018).
openaire +5 more sources
Journal of Energy in Southern Africa, 2022 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
Application of the averaging method to the problems of optimal control of the impulse systems
Karpatsʹkì Matematičnì Publìkacìï, 2020 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
IEEE Access, 2023 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
Almost optimal local well-posedness for modified Boussinesq equations
Electronic Journal of Differential Equations, 2020 In this article, we investigate a class of modified Boussinesq equations, for which we provide first an alternate proof of local well-posedness in the space $(H^s\cap L^\infty)\times (H^s\cap L^\infty)(\mathbb{R})$ ($s\geq 0$) to the one obtained by
Dan-Andrei Geba, Bai Lin
doaj
Almost optimal distance oracles for planar graphs [PDF]
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019 We present new tradeoffs between space and query-time for exact distance oracles in directed weighted planar graphs. These tradeoffs are almost optimal in the sense that they are within polylogarithmic, sub-polynomial or arbitrarily small polynomial factors from the na\"ıve linear space, constant query-time lower bound.
Panagiotis Charalampopoulos +3 more
openaire +2 more sources
Optimal Almost-Balanced Sequences
2024 IEEE International Symposium on Information Theory (ISIT)This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms with small redundancy, preferably constant or even a single bit, for almost balanced sequences has remained unsolved.
Daniella Bar-Lev +3 more
openaire +2 more sources