default search action
Kiminori Matsuzaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Hongtao Zhang
, Kiminori Matsuzaki
Assessing Brain-Like Characteristics of DNNs With Spatiotemporal Features: A Study Based on the Müller-Lyer Illusion. IEEE Access 12: 147192-147208 (2024) - [j20]Lucien Troillet
Evaluating the Influence of Imperfect Information in Geister Using DREAM Trained Agents. IEEE Trans. Games 16(3): 598-610 (2024) - [c38]Kiminori Matsuzaki, Shunsuke Terauchi:
Yet More Optimistic Temporal Difference Learning for Game Mini2048. CoG 2024: 1-8 - 2023
- [c37]Chuanfa Li, Lucien Troillet, Kiminori Matsuzaki:
Complete DouDizhu Agents: Bid Learning from Pretrained Cardplay. CoG 2023: 1-4 - [c36]Shunsuke Terauchi, Takaharu Kubota, Kiminori Matsuzaki
Using Strongly Solved Mini2048 to Analyze Players with N-tuple Networks. TAAI (2) 2023: 165-178 - 2022
- [j19]Hideya Iwasaki
Fregel: a functional domain-specific language for vertex-centric large-scale graph processing. J. Funct. Program. 32: e4 (2022) - [c35]Wang Weikai, Kiminori Matsuzaki:
Improving DNN-based 2048 Players with Global Embedding. CoG 2022: 628-631 - [c34]Runa Kubota, Lucien Troillet, Kiminori Matsuzaki:
Three Player Otrio will be Strongly Solved. TAAI 2022: 30-35 - [c33]Shota Watanabe, Kiminori Matsuzaki:
Enhancement of CNN-based 2048 Player with Monte-Carlo Tree Search. TAAI 2022: 48-53 - 2021
- [j18]Kiminori Matsuzaki:
Developing Value Networks for Game 2048 with Reinforcement Learning. J. Inf. Process. 29: 336-346 (2021) - [c32]Lucien Troillet, Kiminori Matsuzaki:
Analyzing simplified Geister using DREAM. CoG 2021: 1-8
2010 – 2019
- 2019
- [j17]Naoki Kondo, Kiminori Matsuzaki:
Playing Game 2048 with Deep Convolutional Neural Networks Trained by Supervised Learning. J. Inf. Process. 27: 340-347 (2019) - [c31]Kiminori Matsuzaki:
A Further Investigation of Neural Network Players for Game 2048. ACG 2019: 53-65 - 2018
- [j16]Kiminori Matsuzaki, Naoki Kitamura:
Do evaluation functions really improve Monte-Carlo tree search? J. Int. Comput. Games Assoc. 40(3): 294-304 (2018) - [j15]Izumi Asakura, Hidehiko Masuhara, Takuya Matsumoto, Kiminori Matsuzaki:
Identification and Elimination of the Overhead of Accelerate with a Super-resolution Application. J. Inf. Process. 26: 48-53 (2018) - [c30]Shigeyuki Sato, Wei Hao, Kiminori Matsuzaki:
Parallelization of XPath Queries Using Modern XQuery Processors. ADBIS (Short Papers and Workshops) 2018: 54-62 - [c29]Akimasa Morihata
Optimizing Declarative Parallel Distributed Graph Processing by Using Constraint Solvers. FLOPS 2018: 166-181 - [c28]Kiminori Matsuzaki, Madoka Teramura:
Interpreting Neural-Network Players for Game 2048. TAAI 2018: 136-141 - [c27]Kiminori Matsuzaki:
Empirical Analysis of PUCT Algorithm with Evaluation Functions of Different Quality. TAAI 2018: 142-147 - [i2]Shigeyuki Sato, Wei Hao, Kiminori Matsuzaki:
Parallelization of XPath Queries using Modern XQuery Processors. CoRR abs/1806.07728 (2018) - 2017
- [j14]Kiminori Matsuzaki:
Functional Models of Hadoop MapReduce with Application to Scan. Int. J. Parallel Program. 45(2): 362-381 (2017) - [j13]Takuya Matsumoto, Kiminori Matsuzaki:
Evaluation of Libraries for Parallel Computing in Haskell - A Case Study with a Super-resolution Application. J. Inf. Process. 25: 308-316 (2017) - [j12]Reina Miyazaki, Kiminori Matsuzaki, Shigeyuki Sato
A Generator of Hadoop MapReduce Programs that Manipulate One-dimensional Arrays. J. Inf. Process. 25: 841-851 (2017) - [j11]Kazuhiko Kakehi, Kiminori Matsuzaki, Kento Emoto:
Efficient Parallel Tree Reductions on Distributed Memory Environments. Scalable Comput. Pract. Exp. 18(1): 1-15 (2017) - [j10]Kiminori Matsuzaki:
Efficient Implementation of Tree Skeletons on Distributed-Memory Parallel Computers. Scalable Comput. Pract. Exp. 18(1): 17-34 (2017) - [c26]Kiminori Matsuzaki:
Developing a 2048 Player with Backward Temporal Coherence Learning and Restart. ACG 2017: 176-187 - 2016
- [j9]Kiminori Matsuzaki, Reina Miyazaki:
Parallel Tree Accumulations on MapReduce. Int. J. Parallel Program. 44(3): 466-485 (2016) - [j8]Shigeyuki Sato
A Generic Implementation of Tree Skeletons. Int. J. Parallel Program. 44(3): 686-707 (2016) - [j7]Wei Hao, Kiminori Matsuzaki:
A Partial-tree-based Approach for XPath Query on Large XML Trees. J. Inf. Process. 24(2): 425-438 (2016) - [c25]Kazuto Oka, Kiminori Matsuzaki:
Systematic Selection of N-Tuple Networks for 2048. Computers and Games 2016: 81-92 - [c24]Onofre Coll Ruiz, Kiminori Matsuzaki, Shigeyuki Sato
s6raph: vertex-centric graph processing framework with functional interface. FHPC@ICFP 2016: 58-64 - [c23]Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Akimasa Morihata
Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing. ICFP 2016: 200-213 - [c22]Kiminori Matsuzaki:
Systematic selection of N-tuple networks with consideration of interinfluence for game 2048. TAAI 2016: 186-193 - 2015
- [j6]Akimasa Morihata, Kiminori Matsuzaki:
Parallel Tree Contraction with Fewer Types of Primitive Contraction Operations and Its Application to Trees of Unbounded Degree. Inf. Media Technol. 10(1): 17-25 (2015) - 2014
- [j5]Kento Emoto, Kiminori Matsuzaki:
An Automatic Fusion Mechanism for Variable-Length List Skeletons in SkeTo. Int. J. Parallel Program. 42(4): 546-563 (2014) - [j4]Yu Liu, Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu:
Accumulative Computation on MapReduce. Inf. Media Technol. 9(1): 73-82 (2014) - [j3]Takayuki Kawamura, Kiminori Matsuzaki:
Dividing Huge XML Trees Using the m-bridge Technique over One-to-one Corresponding Binary Trees. Inf. Media Technol. 9(3): 251-261 (2014) - [i1]Ryoma Sin'ya, Kiminori Matsuzaki, Masataka Sassa:
Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching. CoRR abs/1405.0562 (2014) - 2013
- [c21]Joeffrey Legaux, Zhenjiang Hu, Frédéric Loulergue
Programming with BSP Homomorphisms. Euro-Par 2013: 446-457 - [c20]Ryoma Sin'ya
Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching. ICPP 2013: 220-229 - 2011
- [c19]Yu Liu, Zhenjiang Hu, Kiminori Matsuzaki:
Towards Systematic Parallel Programming over MapReduce. Euro-Par (2) 2011: 39-50 - [c18]Akimasa Morihata
Balanced trees inhabiting functional parallel programming. ICFP 2011: 117-128 - [c17]Akimasa Morihata
A Practical Tree Contraction Algorithm for Parallel Skeletons on Trees of Unbounded Degree. ICCS 2011: 7-16 - 2010
- [c16]Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Kiminori Matsuzaki, Masato Takeichi:
Generators-of-Generators Library with Optimization Capabilities in Fortress. Euro-Par (2) 2010: 26-37 - [c15]Akimasa Morihata
Automatic Parallelization of Recursive Functions Using Quantifier Elimination. FLOPS 2010: 321-336 - [c14]Louis Gesbert, Zhenjiang Hu, Frédéric Loulergue
Systematic Development of Correct Bulk Synchronous Parallel Programs. PDCAT 2010: 334-340
2000 – 2009
- 2009
- [c13]Kiminori Matsuzaki, Kento Emoto:
Implementing Fusion-Equipped Parallel Skeletons by Expression Templates. IFL 2009: 72-89 - [c12]Akimasa Morihata
The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer. POPL 2009: 177-185 - 2008
- [c11]Akimasa Morihata
Write it recursively: a generic framework for optimal path queries. ICFP 2008: 169-178 - 2007
- [c10]Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi:
Domain-Specific Optimization Strategy for Skeleton Programs. Euro-Par 2007: 705-714 - [c9]Kazuhiko Kakehi, Kiminori Matsuzaki, Kento Emoto:
Efficient Parallel Tree Reductions on Distributed Memory Environments. International Conference on Computational Science (2) 2007: 601-608 - [c8]Kiminori Matsuzaki:
Efficient Implementation of Tree Accumulations on Distributed-Memory Parallel Computers. International Conference on Computational Science (2) 2007: 609-616 - [c7]Kazutaka Morita, Akimasa Morihata
Automatic inversion generates divide-and-conquer parallel programs. PLDI 2007: 146-155 - 2006
- [j2]Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi:
Parallel skeletons for manipulating general trees. Parallel Comput. 32(7-8): 590-603 (2006) - [c6]Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi:
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions. Euro-Par 2006: 605-614 - [c5]Kiminori Matsuzaki, Hideya Iwasaki
A library of constructive skeletons for sequential style of parallel programming. Infoscale 2006: 13 - [c4]Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi:
Towards automatic parallelization of tree reductions in dynamic programming. SPAA 2006: 39-48 - 2005
- [j1]Kiminori Matsuzaki, Zhenjiang Hu, Kazuhiko Kakehi, Masato Takeichi:
Systematic Derivation of Tree Contraction Algorithms. Parallel Process. Lett. 15(3): 321-336 (2005) - 2004
- [c3]Kiminori Matsuzaki, Kazuhiko Kakehi, Hideya Iwasaki
A Fusion-Embedded Skeleton Library. Euro-Par 2004: 644-653 - 2003
- [c2]Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi:
Parallelization with Tree Skeletons. Euro-Par 2003: 789-798 - 2002
- [c1]Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi:
Implementation of Parallel Tree Skeletons on Distributed Systems. APLAS 2002: 258-271
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: