Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Wei Quan"'
Autor:
Wan, Feng, Wang, Wei-Quan, Zhao, Qian, Zhang, Hao, Yu, Tong-Pu, Wang, Wei-Min, Yan, Wen-Chao, Zhao, Yong-Tao, Hatsagortsyan, Karen Z., Keitel, Christoph H., Bulanov, Sergei V., Li, Jian-Xing
Dense high-energy monoenergetic proton beams are vital for wide applications, thus modern laser-plasma-based ion acceleration methods are aiming to obtain high-energy proton beams with energy spread as low as possible. In this work, we put forward a
Externí odkaz:
http://arxiv.org/abs/2104.14239
Autor:
Lim, Wei Quan
This paper describes a 720-vertex connected planar graph G such that cop1(G), denoting the minimum number of cops needed to catch the robber in the 1-cop-move game on G, is at least 4 and at most 7. Furthermore, G has a connected subgraph H such that
Externí odkaz:
http://arxiv.org/abs/1912.07004
Autor:
Gilbert, Seth, Lim, Wei Quan
In this paper we present two versions of a parallel finger structure FS on p processors that supports searches, insertions and deletions, and has a finger at each end. This is to our knowledge the first implementation of a parallel search structure t
Externí odkaz:
http://arxiv.org/abs/1908.02741
Autor:
Lim, Wei Quan
This paper presents a batch-parallel 2-3 tree T in an asynchronous dynamic multithreading model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the restrictive QRMW (queued read-m
Externí odkaz:
http://arxiv.org/abs/1905.05254
In this paper we present two versions of a parallel working-set map on p processors that supports searches, insertions and deletions. In both versions, the total work of all operations when the map has size at least p is bounded by the working-set bo
Externí odkaz:
http://arxiv.org/abs/1805.05787
In this paper we look at the problem of scheduling tasks on a single-processor system, where each task requires unit time and must be scheduled within a certain time window, and each task can be added to or removed from the system at any time. On eac
Externí odkaz:
http://arxiv.org/abs/1507.01981