Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Seiya Okubo"'
Autor:
Hisayuki Nakatani, Shun Narizumi, Seiya Okubo, Suguru Motokucho, Anh Thi Ngoc Dao, Hee-Jin Kim, Mitsuharu Yagi, Yusaku Kyozuka, Shigenobu Miura, Kanth V. Josyula
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-11 (2024)
Abstract It is essential to develop a mechanism for lowering the molecular weight of polyolefins to achieve biodegradation in seawater. In this study, a polypropylene/polylactic acid blend sample was first subjected to photodegradation pretreatment,
Externí odkaz:
https://doaj.org/article/2bf8eb1f1207495fb57ce5bba8e78eec
Publikováno v:
Applied Network Science, Vol 5, Iss 1, Pp 1-21 (2020)
Abstract In this study, we propose novel centrality measures considering multiple perspectives of nodes or node groups based on the facility location problem on a spatial network. The conventional centrality exclusively quantifies the global properti
Externí odkaz:
https://doaj.org/article/61c343e4e7e840ae86ca199a0da05054
Publikováno v:
International Journal of Smart Computing and Artificial Intelligence. 4:18-35
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed5d0660d0b88e5b7f4b2bf3d71dc25e
https://doi.org/10.52731/ijscai.v4.i1.514
https://doi.org/10.52731/ijscai.v4.i1.514
Publikováno v:
EPiC Series in Computing.
The purpose of this study is to analyze the behavior of humans and computers, and distinguish, from the results of the analysis, between humans and computer programs. In this study, we focus on the players of Daihinmin, which is a card game with impe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e5dd8b321fc7a0b0a4c68a4c41c089a
https://doi.org/10.29007/wcsq
https://doi.org/10.29007/wcsq
Publikováno v:
International Journal of Software Innovation. 7:63-79
The purpose of this article is to clarify the fundamentals of the card game Daihinmin. By collecting logs of Daihinmin games on a large scale and analyzing them, the authors illuminate the game's characteristics. They discuss the content required fro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cc947d8bd24cc229a984d87d001913f
https://doi.org/10.4018/ijsi.2019010104
https://doi.org/10.4018/ijsi.2019010104
Publikováno v:
Applied Network Science, Vol 5, Iss 1, Pp 1-21 (2020)
In this study, we propose novel centrality measures considering multiple perspectives of nodes or node groups based on the facility location problem on a spatial network. The conventional centrality exclusively quantifies the global properties of eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3004a79d07f74051085e8af9f66bbc13
https://doi.org/10.1007/s41109-020-00326-7
https://doi.org/10.1007/s41109-020-00326-7
Publikováno v:
International Journal of Software Innovation. 6:1-17
This article describes how computer Daihinmin involves playing Daihinmin, a popular card game in Japan, by using a player program. Because strong player programs of Computer Daihinmin use machine-learning techniques, such as the Monte Carlo method, p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49c66f86e35e1695387c45d47d945381
https://doi.org/10.4018/ijsi.2018070101
https://doi.org/10.4018/ijsi.2018070101
Publikováno v:
Complex Networks and Their Applications VIII ISBN: 9783030366865
COMPLEX NETWORKS (1)
COMPLEX NETWORKS (1)
In this study, we tackle the problem of extracting candidate locations for facilities, such as convenience stores, gas stations, and supermarkets, based on closeness centrality while considering the target city a spatial network. When placing a new f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f22edb3c3ed11fb79b21a7eb45b7546f
https://doi.org/10.1007/978-3-030-36687-2_6
https://doi.org/10.1007/978-3-030-36687-2_6
Publikováno v:
IIAI-AAI
The Monte Carlo tree search has been used in programs that play various games. In this study, we present new applications of the Monte Carlo method for the card game Daihinmin. One is a method of setting good evaluation values in repeated plays of Da
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0e129b855881d7faa919f81313f9b92
https://doi.org/10.1109/iiai-aai.2019.00131
https://doi.org/10.1109/iiai-aai.2019.00131
Publikováno v:
IIAI-AAI
Combinatorial game theory has many ways of measuring game complexity. In this paper, several measures of complexity for the card game Daihinmin are presented to obtain some of its characteristics. Furthermore, we show the difference in playing styles
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4bfe0989af54cbdf6f1def026ca229d
https://doi.org/10.1109/iiai-aai.2019.00125
https://doi.org/10.1109/iiai-aai.2019.00125