Zobrazeno 1 - 10
of 589
pro vyhledávání: '"JIANG Yonggang"'
Publikováno v:
Cailiao gongcheng, Vol 52, Iss 6, Pp 78-91 (2024)
The continuous development of new high-speed space vehicles has put forward an urgent demand for high-temperature resistant， lightweight and high-efficiency thermal insulations. Carbon aerogel not only has the excellent characteristics of low densi
Externí odkaz:
https://doaj.org/article/fd2ba744963e4f63bb2f504029a12ac2
The notion of Las Vegas algorithms was introduced by Babai (1979) and can be defined in two ways: * In Babai's original definition, a randomized algorithm is called Las Vegas if it has a finitely bounded running time and certifiable random failure. *
Externí odkaz:
http://arxiv.org/abs/2311.11679
Autor:
Ashvinkumar, Vikrant, Bernstein, Aaron, Cao, Nairen, Grunau, Christoph, Haeupler, Bernhard, Jiang, Yonggang, Nanongkai, Danupon, Su, Hsin Hao
This paper presents parallel and distributed algorithms for single-source shortest paths when edges can have negative weights (negative-weight SSSP). We show a framework that reduces negative-weight SSSP in either setting to $n^{o(1)}$ calls to any S
Externí odkaz:
http://arxiv.org/abs/2303.00811
Autor:
Jiang, Yonggang, Mukhopadhyay, Sagnik
We present an algorithm for distributed networks to efficiently find a small vertex cut in the CONGEST model. Given a positive integer $\kappa$, our algorithm can, with high probability, either find $\kappa$ vertices whose removal disconnects the net
Externí odkaz:
http://arxiv.org/abs/2302.11651
Autor:
Huang, Ruiming, Jiang, Yonggang, Feng, Junzong, Li, Liangjun, Hu, Yijie, Wang, Xinqiang, Feng, Jian
Publikováno v:
In Chemical Engineering Journal 15 October 2024 498
Autor:
Men, Jing, He, Chenbo, Wang, Lukai, Feng, Junzong, Jiang, Yonggang, Li, Liangjun, Hu, Yijie, Tang, Guihua, Feng, Jian
Publikováno v:
In Chemical Engineering Journal 1 January 2025 503
Autor:
Jiang, Yonggang, Zheng, Chaodong
We consider the classical contention resolution problem where nodes arrive over time, each with a message to send. In each synchronous slot, each node can send or remain idle. If in a slot one node sends alone, it succeeds; otherwise, if multiple nod
Externí odkaz:
http://arxiv.org/abs/2111.06650
Publikováno v:
In Sensors and Actuators: A. Physical 1 August 2024 373
Publikováno v:
In Nano Materials Science June 2024 6(3):312-319
In this paper, we consider contention resolution on a multiple-access communication channel. In this problem, a set of nodes arrive over time, each with a message it intends to send. In each time slot, each node may attempt to broadcast its message o
Externí odkaz:
http://arxiv.org/abs/2102.09716