Zobrazeno 1 - 10
of 9 416
pro vyhledávání: '"Kierstead A"'
Autor:
Araki, Tetsuya, Kobayashi, Koji M.
Kierstead and Trotter (Congressus Numerantium 33, 1981) proved that their algorithm is an optimal online algorithm for the online interval coloring problem. In this paper, for online unit interval coloring, we show that the number of colors used by t
Externí odkaz:
http://arxiv.org/abs/1609.09031
Autor:
Matakias, D., Carini, G., Chen, H., Dabrowski, M., Deptuch, G., Duflot, L., Kierstead, J., Liu, T., Ma, H., Morange, N., Rescia, S., Tang, S., Xu, H.
ALFE2 is an ATLAS Liquid Argon Calorimeter (LAr) Front-End ASIC designed for the HL-LHC upgrade. ALFE2 comprises four channels of pre-amplifiers and CR-(RC)2 shapers with adjustable input impedance. ALFE2 features two separate gain outputs to provide
Externí odkaz:
http://arxiv.org/abs/2402.08901
Autor:
Deng, Binwei, Chen, Hucheng, Chen, Kai, Chen, Jinghong, Gong, Datao, Guo, Di, Hu, Xueye, Huang, Deping, Kierstead, James, Li, Xiaoting, Liu, Chonghan, Liu, Tiankuan, Xiang, Annie C., Xu, Hao, Xu, Tongye, You, Yang, Ye, Jingbo
A prototype Liquid-argon Trigger Digitizer Board (LTDB), called the LTDB Demonstrator, has been developed to demonstrate the functions of the ATLAS Liquid Argon Calorimeter Phase-I trigger electronics upgrade. Forty Analog-to-Digital converters and f
Externí odkaz:
http://arxiv.org/abs/2401.15750
If $L$ is a list assignment of $r$ colors to each vertex of an $n$-vertex graph $G$, then an equitable $L$-coloring of $G$ is a proper coloring of vertices of $G$ from their lists such that no color is used more than $\lceil n/r\rceil$ times. A graph
Externí odkaz:
http://arxiv.org/abs/2309.00989
Autor:
Hanks, Patrick, Lenarčič, Simon
Publikováno v:
Dictionary of American Family Names, 2 ed., 2022.
Externí odkaz:
http://www.oxfordreference.com/view/10.1093/acref/9780190245115.001.0001/acref-9780190245115-e-38459
Autor:
Kierstead, Henry, Ren, Eric
Let $G$ be a connected graph on $n$ vertices. The Gallai number $Gal(G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$. Gr\"unbaum constructed a graph $G$ with $Gal(G)=3$. Very recently, Long, Milans, and Mun
Externí odkaz:
http://arxiv.org/abs/2305.05045
Publikováno v:
Journal of Medical Internet Research, Vol 26, p e52129 (2024)
BackgroundDespite the prevalence of vaping nicotine, most nicotine cessation research remains focused on smoking cigarettes. However, the lived experience of quitting smoking is different from quitting vaping. As a result, research examining the uniq
Externí odkaz:
https://doaj.org/article/ebc686b46aae47c28dce3089275d4d57
Publikováno v:
Frontiers in Education, Vol 9 (2024)
Mixed methods research teams have garnered increased attention for their leveraging of diverse disciplinary and methodological expertise in pursuit of complex problems. We advance our theoretical viewpoint of integrative mixed methods research teamwo
Externí odkaz:
https://doaj.org/article/6b8daab94ccb4bd7a69c260948713aa4
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.
Publikováno v:
Frontiers in Education; 2024, p1-6, 6p