Zobrazeno 1 - 10
of 49 105
pro vyhledávání: '"Adaptive method"'
Autor:
Hu, Shiwei, Xiao, Tianbai, Han, Mingshuo, Li, Zuoxu, Oterkus, Erkan, Oterkus, Selda, Zhang, Yonghao
Understanding the quasi-static fracture formation and evolution is essential for assessing the mechanical properties and structural load-bearing capacity of materials. Peridynamics (PD) provides an effective computational method to depict fracture me
Externí odkaz:
http://arxiv.org/abs/2410.12552
Autor:
Liu, Chengyuan, Wang, Shihang, Qing, Lizhi, Kuang, Kun, Kang, Yangyang, Sun, Changlong, Wu, Fei
While Large Language Models (LLMs) demonstrate impressive generation abilities, they frequently struggle when it comes to specialized domains due to their limited domain-specific knowledge. Studies on domain-specific LLMs resort to expanding the voca
Externí odkaz:
http://arxiv.org/abs/2410.01188
Online decision-making can be formulated as the popular stochastic multi-armed bandit problem where a learner makes decisions (or takes actions) to maximize cumulative rewards collected from an unknown environment. A specific variant of the bandit pr
Externí odkaz:
http://arxiv.org/abs/2406.10418
Autor:
Kaci, Mustapha1 kaci.mustapha.95@gmail.com, Radjef, Sonia1
Publikováno v:
Operations Research & Decisions. 2023, Vol. 33 Issue 4, p29-44. 16p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Vali Torkashvand
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 6, Iss 1, Pp 81-93 (2024)
The adaptive technique enables us to achieve the highest efficiency index theoretically and practically. The idea of introducing an adaptive self-accelerator (via all the old information for Steffensen-type methods) is new and efficient to obtain the
Externí odkaz:
https://doaj.org/article/948bc8a0a9284de0a8c8340f14f33e71
Autor:
Vermeylen, Charlotte, Van Barel, Marc
In this paper a new Riemannian rank adaptive method (RRAM) is proposed for the low-rank tensor completion problem (LRTCP) formulated as a least-squares optimization problem on the algebraic variety of tensors of bounded tensor-train (TT) rank. The me
Externí odkaz:
http://arxiv.org/abs/2402.12182
Autor:
Hu, Siqi1,2 (AUTHOR) hannah_hu547@163.com, Meng, Keqilao1,2 (AUTHOR) 13932075138@163.com, Wu, Zikai1,2 (AUTHOR)
Publikováno v:
Sensors (14248220). Oct2024, Vol. 24 Issue 20, p6651. 24p.