Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Keh-Hsun Chen"'
Autor:
Shanzhen Gao, Keh-Hsun Chen
Publikováno v:
2018 International Conference on Computational Science and Computational Intelligence (CSCI).
Lattice path enumeration and its applications have been studied by researchers in many areas such as computer science, mathematics, biology, physics, chemistry and statistics. They are related to number theory, geometry theory, combinatorics, graph t
Autor:
Keh-Hsun Chen, Shanzhen Gao
Publikováno v:
2018 International Conference on Computational Science and Computational Intelligence (CSCI).
The enumeration of integer-matrices has been the subject of considerable study and it is unlikely that a simple formula exists. The number in question can be related in various ways to the representation theory of the symmetric group or of the comple
Autor:
Shanzhen Gao, Keh-Hsun Chen
Publikováno v:
2017 International Conference on Computational Science and Computational Intelligence (CSCI).
Autor:
Shanzhen Gao, Keh-Hsun Chen
Publikováno v:
2017 International Conference on Computational Science and Computational Intelligence (CSCI).
Autor:
Shanzhen Gao, Keh-Hsun Chen
Publikováno v:
2016 International Conference on Computational Science and Computational Intelligence (CSCI).
Autor:
Shanzhen Gao, Keh-Hsun Chen
Publikováno v:
2016 International Conference on Computational Science and Computational Intelligence (CSCI).
In our "Unsolved Problems in Computational Science", we will talk about some interesting open problems in computational science. These problems are related to number theory, geometry theory, combinatorics, graph theory, linear algebra and group theor
Autor:
Keh-Hsun Chen, Shanzhen Gao
Publikováno v:
2016 International Conference on Computational Science and Computational Intelligence (CSCI).
In the more than 100 years since Markoff-Hurwitz Equations, they play a decisive role, have turned up in an astounding variety of different settings, from number theory to combinatorics, from classical groups and geometry to the world of graphs and w
Autor:
Peigang Zhang, Keh-Hsun Chen
Publikováno v:
Journal of Computer Science. 8:1594-1600
Problem statement: Expert level opening knowledge is beneficial to game playing programs. Unfortunately, expert level opening knowledge is only sparsely available for 9×9 Go. We set to build expert level opening books for 9×9 Go. Approach: We prese
Dynamic randomization and domain knowledge in Monte-Carlo Tree Search for Go knowledge-based systems
Autor:
Keh-Hsun Chen
Publikováno v:
Knowledge-Based Systems. 34:21-25
This paper is an extension of the article [13] presented at IWCG of TAAI 2010. It proposes two dynamic randomization techniques for Monte-Carlo Tree Search (MCTS) in Go. First, during the in-tree phase of a simulation game, the parameters are randomi
Publikováno v:
System Dynamics Review (Wiley). Fall1992, Vol. 8 Issue 3, p213-232. 20p. 5 Diagrams, 1 Chart, 12 Graphs.