Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Garrett Andersen"'
Autor:
Sheng Li, Garrett Andersen, Tao Chen, Liqun Cheng, Julian Grady, Da Huang, Quoc V. Le, Andrew Li, Xin Li, Yang Li, Chen Liang, Yifeng Lu, Yun Ni, Ruoming Pang, Mingxing Tan, Martin Wicke, Gang Wu, Shengqi Zhu, Parthasarathy Ranganathan, Norman P. Jouppi
Publikováno v:
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3.
Autor:
Torbjørn, Graven, Bjørnar, Klykken, Olaf, Kleinau, Kyrre, Skjetne, Garrett, Andersen, Håvard, Dalen
Publikováno v:
Tidsskrift for den Norske laegeforening : tidsskrift for praktisk medicin, ny raekke. 141(2021-12)
The study aimed to evaluate a new algorithm based on analyses of high-sensitivity troponin I for rapid diagnostic clarification in cases of suspected cardiac chest pain.Two time periods - before (01.10.2016-31.12.2016) and after (01.03.2017-28.02.201
Autor:
Somdeb Majumdar, Zhengfei Wang, Lance Rane, Zeyang Yu, Marcel Salathé, Aditya Bhatt, Ruihan Yang, Aleksandra Malysheva, Fan Wang, Łukasz Kidziński, Jeremy D. Watson, Bo Zhou, Rongzhong Lian, Aleksei Shpilman, Zhen Wang, Sharada P. Mohanty, Sergey Kolesnikov, Jennifer L. Hicks, Quan Yuan, Hao Tian, Carmichael F. Ong, Wojciech Jaśkowski, Yunsheng Tian, Nihat Engin Toklu, Shauharda Khadka, Minghui Qiu, Yinyin Liu, Sean F. Carroll, Ivan Sosin, Rupesh Kumar Srivastava, Xu Hu, Evren Tumer, Pranav Shyam, Scott L. Delp, Oleg Svidchenko, Daniel Kudenko, Oleksii Hrinchuk, Odd Rune Lykkebø, Wenxin Li, Sergey Levine, Mattias Ljungström, Pingchuan Ma, Zehong Hu, Hongsheng Zeng, Anton Pechenko, Zach Dwiel, Jun Huang, Peng Peng, Penghui Qi, Garrett Andersen
Publikováno v:
The NeurIPS '18 Competition ISBN: 9783030291341
In the NeurIPS 2018 Artificial Intelligence for Prosthetics challenge, participants were tasked with building a controller for a musculoskeletal model with a goal of matching a given time-varying velocity vector. Top participants described their algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d4e062dd76b67ed52e1d9e01a8e0900
https://doi.org/10.1007/978-3-030-29135-8_4
https://doi.org/10.1007/978-3-030-29135-8_4
Autor:
Garrett Andersen, Vincent Conitzer
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 27:53-59
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoffs) can be computed in polynomial time, as follows: according to the folk theorem, we compute minimax strategies for both players to calculate the puni