Results 21 to 30 of about 4,545,606 (290)
Greedy Is an Almost Optimal Deque [PDF]
, 2015 In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Patrascu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP.
Parinya Chalermsook +4 more
openaire +4 more sources
Embedding almost-complex manifolds in almost-complex euclidean spaces [PDF]
, 2011 We show that any compact almost-complex manifold (M, J) of complex dimension m can be pseudo-holomorphically embedded in R6m equipped with a suitable almost-complex structure
Antonio J. Di Scala +6 more
core +1 more source
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 +3 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
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
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
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 +3 more sources
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
On the optimal use of almost and barely in argumentation [PDF]
Proceedings of the Amsterdam Colloquium, 2007 -
Gerrevink, R. van, Hoop, H. de
openaire +2 more sources
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