Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Stephen Tschudi"'
Autor:
Jacobus, John M.
Publikováno v:
The Art Bulletin, 1958 Dec 01. 40(4), 364-373.
Externí odkaz:
https://www.jstor.org/stable/3047805
Autor:
Fitch, James Marston
Publikováno v:
The Art Bulletin, 1977 Sep 01. 59(3), 447-448.
Externí odkaz:
https://www.jstor.org/stable/3049690
Autor:
Stovel, Herb
Publikováno v:
Bulletin of the Association for Preservation Technology, 1982 Jan 01. 14(2), 45-46.
Externí odkaz:
https://www.jstor.org/stable/1493988
Autor:
Aslin, Elizabeth M.
Publikováno v:
The Burlington Magazine, 1957 Nov 01. 99(656), 389-390.
Externí odkaz:
https://www.jstor.org/stable/872339
Autor:
John M. Jacobus
Publikováno v:
The Art Bulletin. 40:364-373
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::783a1f182b536d837a8a52be8859af85
https://doi.org/10.1080/00043079.1958.11408569
https://doi.org/10.1080/00043079.1958.11408569
Autor:
Richard Medina, Stephen Tschudi
Publikováno v:
Proceedings of the Annual Hawaii International Conference on System Sciences.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::454867eb350194b8e7f31ed8d2bf4121
https://doi.org/10.24251/hicss.2022.708
https://doi.org/10.24251/hicss.2022.708
Autor:
Charles E. Leiserson, Stephen Tschudi, Bradley C. Kuszmaul, Pramod Ganapathi, Jesmin Jahan Tithi, Armando Solar-Lezama, Charles Bachmeier, Yuan Tang, Rezaul Chowdhury
Publikováno v:
MIT web domain
We present A utogen —an algorithm that for a wide class of dynamic programming (DP) problems automatically discovers highly efficient cache-oblivious parallel recursive divide-and-conquer algorithms from inefficient iterative descriptions of DP rec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6aa4a383a6fb417ca8ef46fec3bcf170
https://doi.org/10.1145/3125632
https://doi.org/10.1145/3125632
Autor:
Rathish Das, Pramod Ganapathr, Rezaul Chowdhury, Mohammad Mahdi Javanmard, Stephen Tschudi, Zafar Ahmad
Publikováno v:
PPoPP
Recursive divide-&-conquer algorithms are known for solving dynamic programming (DP) problems efficiently on shared-memory multicore machines. In this work, we extend them to run efficiently also on manycore GPUs and distributed-memory machines witho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::714311116ca984c8804c8a9c889bfca2
https://doi.org/10.1145/3293883.3299109
https://doi.org/10.1145/3293883.3299109
Autor:
Mohammad Mahdi Javanmard, Stephen Tschudi, Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030206550
We argue that the recursive divide-and-conquer paradigm is highly suited for designing algorithms to run efficiently under both shared-memory (multi- and manycores) and distributed-memory settings. The depth-first recursive decomposition of tasks and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c7d75cbc214c8a78432a5947c7437cc
https://doi.org/10.1007/978-3-030-20656-7_8
https://doi.org/10.1007/978-3-030-20656-7_8
Autor:
Matthew G. Reuter, Stephen Tschudi
Publikováno v:
Nanotechnology. 27(42)
When investigating the electronic response properties of molecules, experiments often measure conductance whereas computation predicts the transmission probability. Although Landauer-Buttiker theory usually relates the two, comparison between experim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fec9488f00aa50a75f9cfcf287129df5
https://pubmed.ncbi.nlm.nih.gov/27623441
https://pubmed.ncbi.nlm.nih.gov/27623441