Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Jonathan Gerhard"'
Autor:
Adiel Joshua Preciado Rodriguez, Flor Mayerli Flores Guillén, Aldo Emanuel Soraluz Soraluz, Jonathan Gerhard Rios Jara
Publikováno v:
Revista Cubana de Informática Médica, Vol 14, Iss 1, Pp e471-e471 (2022)
La Inteligencia Artificial ha ayudado a lidiar diferentes problemas relacionados con los datos masivos y a su vez con su tratamiento, diagnóstico y detección de enfermedades como la que actualmente nos preocupa, la Covid-19. El objetivo de esta inv
Externí odkaz:
https://doaj.org/article/a2688fc0b2734b4182368064a31b0ba7
Autor:
Preciado Rodríguez, Adiel Joshua, Flores Guillen, Flor Mayerli, Soraluz Soraluz, Aldo Emanuel, Ríos Jara, Jonathan Gerhard
Publikováno v:
Revista Cubana de Informática Médica; ene-jun2022, Vol. 14 Issue 1, p64-76, 13p
Publikováno v:
The Electronic Journal of Combinatorics. 23
Let $R_{n}$ denote the graph with vertex set consisting of the squares of an $n \times n$ grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook's graph, and can also be thought of as the Cartesia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f88a6445ce536bd8c2b7a9a44171771a
https://doi.org/10.37236/5442
https://doi.org/10.37236/5442
Autor:
Jonathan Gerhard, Bruce E. Sagan, Lindsey R. Campbell, Thomas Grubb, Carlin Purcell, Samantha Dahlberg, Robert Dorward
A restricted growth function (RGF) of length n is a sequence w = w_1 w_2 ... w_n of positive integers such that w_1 = 1 and w_i is at most 1 + max{w_1,..., w_{i-1}} for i at least 2. RGFs are of interest because they are in natural bijection with set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1307557dc5447ad82e5c99fa8dadd94
Autor:
Robert Dorward, Lindsey Reppuhn, Samantha Dahlberg, Carlin Purcell, Jonathan Gerhard, Bruce E. Sagan, Thomas Grubb
A set partition $\sigma$ of $[n]=\{1,\dots,n\}$ contains another set partition $\pi$ if restricting $\sigma$ to some $S\subseteq[n]$ and then standardizing the result gives $\pi$. Otherwise we say $\sigma$ avoids $\pi$. For all sets of patterns consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3f74556f00b346ebbdda9cbc56081e7
Publikováno v:
Revista Cubana de Informática Médica; ene-jun2024, Vol. 16 Issue 1, p1-32, 32p
Autor:
Eddy, Douglas C.1 (AUTHOR) dceddy@engin.umass.edu, Krishnamurty, Sundar1 (AUTHOR), Grosse, Ian R.1 (AUTHOR), Steudel, Mark2 (AUTHOR)
Publikováno v:
Journal of Engineering Design. Jan2020, Vol. 31 Issue 1, p1-36. 36p. 7 Diagrams, 24 Charts, 3 Graphs.
Publikováno v:
Journal of Positive School Psychology; 2022, Vol. 6 Issue 9, p1591-1599, 9p
Autor:
Lucas, Stephen K., Taalman, Laura
Publikováno v:
Journal of Mathematics & the Arts; Mar-Jun2022, Vol. 16 Issue 1/2, p121-132, 12p