Zobrazeno 1 - 10
of 844
pro vyhledávání: '"Tennenhouse A"'
Autor:
Tennenhouse, Ilan, Raviv, Netanel
As blockchains continue to seek to scale to a larger number of nodes, the communication complexity of protocols has become a significant priority as the network can quickly become overburdened. Several schemes have attempted to address this, one of w
Externí odkaz:
http://arxiv.org/abs/2305.05977
Autor:
Burke, Kyle, Tennenhouse, Craig
We define a new, partizan, loopy combinatorial game, Forced-Capture Hnefatafl, similar to Hnefatafl, except that players are forced to make capturing moves when available. We show that this game is PSPACE-hard using a reduction from Constraint Logic,
Externí odkaz:
http://arxiv.org/abs/2301.06127
Autor:
Burke, Kyle, Tennenhouse, Craig
We define a new impartial combinatorial game, Flag Coloring, based on flood filling. We then generalize to a graph game, and find values for many positions on two colors. We demonstrate that the generalized game is PSPACE-complete for two colors or m
Externí odkaz:
http://arxiv.org/abs/2212.10631
Autor:
Sylvain A. Lother, Lana Tennenhouse, Rasheda Rabbani, Ahmed M. Abou-Setta, Nicole Askin, Alexis F. Turgeon, Srinivas Murthy, Brett L. Houston, Donald S. Houston, Asher A. Mendelson, Jonathan D. Paul, Michael E. Farkouh, Jovan Hasmatali, Barret Rush, Joel Nkosi, Ewan C. Goligher, Emily Rimmer, John C. Marshall, Souradet Y. Shaw, Patrick R. Lawler, Yoav Keynan, Ryan Zarychanski
Publikováno v:
Research and Practice in Thrombosis and Haemostasis, Vol 8, Iss 5, Pp 102526- (2024)
Background: Community-acquired pneumonia (CAP) triggers inflammatory and thrombotic host responses driving morbidity and mortality. Antiplatelet agents may favorably modulate these pathways; however, their role in non–COVID-19 CAP remains uncertain
Externí odkaz:
https://doaj.org/article/57373b1e9cdf4488a5be3c22ae4d42e4
Autor:
Burke, Kyle, Khovanova, Tanya, Lee, Joshua, Nowakowski, Richard J., Rowland, Amelia, Tennenhouse, Craig
We discuss games involving a counterfeit coin. Given one counterfeit coin among a number of otherwise identical coins, two players with full knowledge of the fake coin take turns weighing coins on a two-pan scale, under the condition that on every tu
Externí odkaz:
http://arxiv.org/abs/2201.04973
Autor:
Burke, Kyle, Tennenhouse, Craig
Publikováno v:
In Theoretical Computer Science 27 July 2024 1006
Autor:
Lother, Sylvain A., Tennenhouse, Lana, Rabbani, Rasheda, Abou-Setta, Ahmed M., Askin, Nicole, Turgeon, Alexis F., Murthy, Srinivas, Houston, Brett L., Houston, Donald S., Mendelson, Asher A., Paul, Jonathan D., Farkouh, Michael E., Hasmatali, Jovan, Rush, Barret, Nkosi, Joel, Goligher, Ewan C., Rimmer, Emily, Marshall, John C., Shaw, Souradet Y., Lawler, Patrick R., Keynan, Yoav, Zarychanski, Ryan
Publikováno v:
In Research and Practice in Thrombosis and Haemostasis July 2024 8(5)
Autor:
Huggan, Melissa A., Tennenhouse, Craig
Genetic programming is the practice of evolving formulas using crossover and mutation of genes representing functional operations. Motivated by genetic evolution we develop and solve two combinatorial games, and we demonstrate some advantages and pit
Externí odkaz:
http://arxiv.org/abs/2102.00476
Autor:
Tennenhouse, Craig
The study of combinatorial games is intimately tied to the study of graphs, as any game can be realized as a directed graph in which players take turns traversing the edges until reaching a sink. However, there have heretofore been few efforts toward
Externí odkaz:
http://arxiv.org/abs/1905.05033
We prove that if a directed multigraph $D$ has at most $t$ pairwise arc-disjoint directed triangles, then there exists a set of less than $2t$ arcs in $D$ which meets all directed triangles in $D$, except in the trivial case $t=0$. This answers affir
Externí odkaz:
http://arxiv.org/abs/1806.08809