Mitsuo Wakatsuki

According to our database, Mitsuo Wakatsuki authored at least 21 papers between 1995 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

Toward a Statistical Characterization of Computer Daihinmin.

Seiya Okubo, Yuta Kado, Yamato Takeuchi, Mitsuo Wakatsuki, Tetsuro Nishino

Int. J. Softw. Innov., 2019

What are the Characteristics of the Card Game Daihinmin?

Mitsuo Wakatsuki, Yuta Kado, Yamato Takeuchi, Seiya Okubo, Tetsuro Nishino

Proceedings of the 8th International Congress on Advanced Applied Informatics, 2019

New Applications of the Monte Carlo Method for Computer Daihinmin.

Seiya Okubo, Tasuku Mitsuishi, Yasuki Dobashi, Mitsuo Wakatsuki, Tetsuro Nishino

Proceedings of the 8th International Congress on Advanced Applied Informatics, 2019

2018

A Decision Tree Analysis of a Multi-Player Card Game With Imperfect Information.

Masato Konishi, Seiya Okubo, Tetsuro Nishino, Mitsuo Wakatsuki

Int. J. Softw. Innov., 2018

2017

A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments.

Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki

J. Inf. Process., 2017

2016

A Decision Making Method Based on Society of Mind Theory in Multi-Player Imperfect Information Games.

Mitsuo Wakatsuki, Mari Fujimura, Tetsuro Nishino

Int. J. Softw. Innov., 2016

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.

Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015

A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State.

Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino

Proceedings of the Software Engineering, 2015

A Source Code Plagiarism Detecting Method Using Sequence Alignment with Abstract Syntax Tree Elements.

Hiroshi Kikuchi, Takaaki Goto, Mitsuo Wakatsuki, Tetsuro Nishino

Int. J. Softw. Innov., 2015

2014

A source code plagiarism detecting method using alignment with abstract syntax tree elements.

Hiroshi Kikuchi, Takaaki Goto, Mitsuo Wakatsuki, Tetsuro Nishino

Proceedings of the 15th IEEE/ACIS International Conference on Software Engineering, 2014

2013

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments.

Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki

IEICE Trans. Inf. Syst., 2013

A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State.

Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino

Proceedings of the 14th ACIS International Conference on Software Engineering, 2013

2010

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.

Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers.

Mitsuo Wakatsuki, Etsuji Tomita

Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

2008

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.

Mitsuo Wakatsuki, Etsuji Tomita

IEICE Trans. Inf. Syst., 2008

2006

A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data.

Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2004

Polynomial time learning of simple deterministic languages via queries and a representative sample.

Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada

Theor. Comput. Sci., 2004

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.

Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

1997

A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations.

Etsuji Tomita, Ken'ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki

Syst. Comput. Jpn., 1997

1995

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State.

Ken Higuchi, Mitsuo Wakatsuki, Etsuji Tomita

IEICE Trans. Inf. Syst., 1995

A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata.

Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki

IEICE Trans. Inf. Syst., 1995