Zobrazeno 1 - 10
of 4 059
pro vyhledávání: '"A. Latypov"'
We give the first parallel algorithm with optimal $\tilde{O}(m)$ work for the classical problem of computing Single-Source Shortest Paths in general graphs with negative-weight edges. In graphs without negative edges, Dijkstra's algorithm solves the
Externí odkaz:
http://arxiv.org/abs/2410.20959
Autor:
Latypov, Ilgam, Dorn, Yuriy
In practical engineering and optimization, solving multi-objective optimization (MOO) problems typically involves scalarization methods that convert a multi-objective problem into a single-objective one. While effective, these methods often incur sig
Externí odkaz:
http://arxiv.org/abs/2410.03023
Autor:
Whitman, Sheila E., Latypov, Marat I.
This study introduces the calculation of spatially-resolved chord length distribution (SR-CLD) as an efficient approach for quantifying and visualizing non-uniform microstructures in heterogeneous materials. SR-CLD enables detailed analysis of spatia
Externí odkaz:
http://arxiv.org/abs/2409.03729
Publikováno v:
Scripta Materialia (2025) 116407
High-cycle fatigue is a critical performance metric of structural alloys for many applications. The high cost, time, and labor involved in experimental fatigue testing call for efficient and accurate computer models of fatigue life. We present FIP-GN
Externí odkaz:
http://arxiv.org/abs/2406.08682
Autor:
Demin, Alexander, Dorn, Yuriy, Katrutsa, Aleksandr, Kazantsev, Daniil, Latypov, Ilgam, Maximlyuk, Yulia, Ponomaryov, Denis
Optimal page replacement is an important problem in efficient buffer management. The range of replacement strategies known in the literature varies from simple but efficient FIFO-based algorithms to more accurate but potentially costly methods tailor
Externí odkaz:
http://arxiv.org/abs/2405.00154
Classic symmetry-breaking problems on graphs have gained a lot of attention in models of modern parallel computation. The Adaptive Massively Parallel Computation (AMPC) is a model that captures the central challenges in data center computations. Chan
Externí odkaz:
http://arxiv.org/abs/2402.13755
In this study, we propose a new method for constructing UCB-type algorithms for stochastic multi-armed bandits based on general convex optimization methods with an inexact oracle. We derive the regret bounds corresponding to the convergence rates of
Externí odkaz:
http://arxiv.org/abs/2402.07062
Autor:
Hu, Guangyu, Latypov, Marat I.
We present AnisoGNNs -- graph neural networks (GNNs) that generalize predictions of anisotropic properties of polycrystals in arbitrary testing directions without the need in excessive training data. To this end, we develop GNNs with a physics-inspir
Externí odkaz:
http://arxiv.org/abs/2401.16271
We show the first conditionally optimal deterministic algorithm for $3$-coloring forests in the low-space massively parallel computation (MPC) model. Our algorithm runs in $O(\log \log n)$ rounds and uses optimal global space. The best previous algor
Externí odkaz:
http://arxiv.org/abs/2308.00355
Autor:
Gupta, Chetan, Latypov, Rustam, Maus, Yannic, Pai, Shreyas, Särkkä, Simo, Studený, Jan, Suomela, Jukka, Uitto, Jara, Vahidi, Hossein
We present a deterministic algorithm for solving a wide range of dynamic programming problems in trees in $O(\log D)$ rounds in the massively parallel computation model (MPC), with $O(n^\delta)$ words of local memory per machine, for any given consta
Externí odkaz:
http://arxiv.org/abs/2305.03693