Zobrazeno 1 - 10
of 621
pro vyhledávání: '"Benjamin Moseley"'
Autor:
Christopher M. Orton, Henry E. Symons, Benjamin Moseley, Justice Archer, Natalie A. Watson, Keir E. J. Philip, Sadiyah Sheikh, Brian Saccente-Kennedy, Declan Costello, William J. Browne, James D. Calder, Bryan R. Bzdek, James H. Hull, Jonathan P. Reid, Pallav L. Shah
Publikováno v:
Communications Medicine, Vol 2, Iss 1, Pp 1-9 (2022)
Orton and Symons et al. compare respiratory particle sizes and emission rates by sampling exhalates from participants at rest, and while speaking or exercising. They find that vocalisation produces larger particles and that while emission rates are s
Externí odkaz:
https://doaj.org/article/5f2f9083c7854a6bb237513b87deeffe
Publikováno v:
PLoS ONE, Vol 15, Iss 2, p e0229083 (2020)
Learning synaptic weights of spiking neural network (SNN) models that can reproduce target spike trains from provided neural firing data is a central problem in computational neuroscience and spike-based computing. The discovery of the optimal weight
Externí odkaz:
https://doaj.org/article/fc54297a5b654bd19e7cdb2bef7c6891
Autor:
Shai Vardi, Benjamin Moseley
Publikováno v:
Operations Research Letters. 50:20-27
Round Robin is a widely used scheduling policy, used primarily because it is intuitively fair, splitting the resources evenly among the jobs. Little is known, however, of its fairness with respect to completion times for the jobs, which is typically
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06928d51f9ef974882d761b0eff3866f
https://doi.org/10.1016/j.orl.2021.11.008
https://doi.org/10.1016/j.orl.2021.11.008
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4beb8fc336fd6fb4612bad61f30e0570
https://doi.org/10.1137/1.9781611977554.ch73
https://doi.org/10.1137/1.9781611977554.ch73
Autor:
Joshua Harrison, Brian Saccente-Kennedy, Christopher M. Orton, Lauren P. McCarthy, Justice Archer, Henry E. Symons, Alicja Szczepanska, Natalie A. Watson, William J. Browne, Benjamin Moseley, Keir E. J. Philip, James H. Hull, James D. Calder, Declan Costello, Pallav L. Shah, Ruth Epstein, Jonathan P. Reid, Bryan R. Bzdek
The severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) pandemic has brought renewed attention to respiratory aerosol and droplet generation. While many studies have robustly quantified aerosol (20 µm diameter) generated by a cohort of 76 a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b7c7cd58b0c60c3be000b1cc061e2af
Publikováno v:
Mathematics of operations research, 46(3), 1230-1234. INFORMS Institute for Operations Research and the Management Sciences
This corrigendum fixes an incorrect claim in the paper Gupta et al. [Gupta V, Moseley B, Uetz M, Xie Q (2020) Greed works—online algorithms for unrelated machine stochastic scheduling. Math. Oper. Res. 45(2):497–516.], which led us to claim a per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaab9e601913957bffb1cb4cb488daae
https://doi.org/10.1287/moor.2021.1149
https://doi.org/10.1287/moor.2021.1149
Autor:
Daniel DeLayo, Kenny Zhang, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Rathish Das, Benjamin Moseley, Cynthia A. Phillips
Publikováno v:
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89c62004567beb3c124ff48a0c2bf906
https://doi.org/10.1145/3490148.3538570
https://doi.org/10.1145/3490148.3538570
We show that there exist $k$-colorable matroids that are not $(b,c)$-decomposable when $b$ and $c$ are constants. A matroid is $(b,c)$-decomposable, if its ground set of elements can be partitioned into sets $X_1, X_2, \ldots, X_l$ with the following
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f49cea72eb95b30c027042d9d70ae02
http://arxiv.org/abs/2206.12896
http://arxiv.org/abs/2206.12896
Publikováno v:
Operations Research Letters. 49:405-411
In this paper we introduce the Matroid Cup Game. This cup game generalizes the One- and p-Cup Games. We show that a natural greedy strategy maintains max fill O ( log n ) in the Matroid Cup Game with mild resource augmentation. Further, we introd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f1a820b5a2c0a01a2773d4fffdacc15
https://doi.org/10.1016/j.orl.2021.04.005
https://doi.org/10.1016/j.orl.2021.04.005
Publikováno v:
Operations Research Letters. 49:17-22
We consider the matroid intersection cover problem. This is a special case of set cover where the sets are derived from the intersection of matroids. We introduce a technique for computing matroid intersection covers. We give polynomial-time algorith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d199c32e575cfe2c35ffa4158e569db5
https://doi.org/10.1016/j.orl.2020.11.003
https://doi.org/10.1016/j.orl.2020.11.003