Mitsuo Wakatsuki

Publication Activity (10 Years)

Years Active: 1995-2019
Publications (10 Years): 7

Top Topics

Monte Carlo Method

Strongly Polynomial

Top Venues

Int. J. Softw. Innov.

IEICE Trans. Inf. Syst.

Publications

Seiya Okubo, Yuta Kado, Yamato Takeuchi, Mitsuo Wakatsuki, Tetsuro Nishino
Toward a Statistical Characterization of Computer Daihinmin. Int. J. Softw. Innov. 7 (1) (2019)
Mitsuo Wakatsuki, Yuta Kado, Yamato Takeuchi, Seiya Okubo, Tetsuro Nishino
What are the Characteristics of the Card Game Daihinmin? IIAI-AAI (2019)
Seiya Okubo, Tasuku Mitsuishi, Yasuki Dobashi, Mitsuo Wakatsuki, Tetsuro Nishino
New Applications of the Monte Carlo Method for Computer Daihinmin. IIAI-AAI (2019)
Masato Konishi, Seiya Okubo, Tetsuro Nishino, Mitsuo Wakatsuki
A Decision Tree Analysis of a Multi-Player Card Game With Imperfect Information. Int. J. Softw. Innov. 6 (3) (2018)
Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. J. Inf. Process. 25 (2017)
Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. FAW (2016)
Mitsuo Wakatsuki, Mari Fujimura, Tetsuro Nishino
A Decision Making Method Based on Society of Mind Theory in Multi-Player Imperfect Information Games. Int. J. Softw. Innov. 4 (2) (2016)
Hiroshi Kikuchi, Takaaki Goto, Mitsuo Wakatsuki, Tetsuro Nishino
A Source Code Plagiarism Detecting Method Using Sequence Alignment with Abstract Syntax Tree Elements. Int. J. Softw. Innov. 3 (3) (2015)
Mitsuo Wakatsuki, Mari Fujimura, Tetsuro Nishino
A Decision Making Method Based on Society of Mind Theory in Multi-player Imperfect Information Games. ACIT-CSI (2015)
Hiroshi Kikuchi, Takaaki Goto, Mitsuo Wakatsuki, Tetsuro Nishino
A source code plagiarism detecting method using alignment with abstract syntax tree elements. SNPD (2014)
Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments. IEICE Trans. Inf. Syst. (6) (2013)
Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State. SNPD (2013)
Mitsuo Wakatsuki, Etsuji Tomita
Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers. ICGI (2010)
Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. WALCOM (2010)
Mitsuo Wakatsuki, Etsuji Tomita
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. IEICE Trans. Inf. Syst. (6) (2008)
Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada
A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data. ICGI (2006)
Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. ICGI (2004)
Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada
Polynomial time learning of simple deterministic languages via queries and a representative sample. Theor. Comput. Sci. 329 (1-3) (2004)
Etsuji Tomita, Ken'ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki
A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations. Systems and Computers in Japan 28 (5) (1997)
Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki
A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata. IEICE Trans. Inf. Syst. (4) (1995)
Ken Higuchi, Mitsuo Wakatsuki, Etsuji Tomita
A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State. IEICE Trans. Inf. Syst. (8) (1995)