Mitsuo Wakatsuki - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2019

2018

A Decision Tree Analysis of a Multi-Player Card Game With Imperfect InformationMasato Konishi, Seiya Okubo, Tetsuro Nishino, Mitsuo Wakatsuki. ijsinnov, 6(3):1-17, 2018. [doi]

2017

A Much Faster Algorithm for Finding a Maximum Clique with Computational ExperimentsEtsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki. jip, 25:667-677, 2017. [doi]

2016

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum CliqueEtsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki. faw 2016: 215-226 [doi]

A Decision Making Method Based on Society of Mind Theory in Multi-Player Imperfect Information GamesMitsuo Wakatsuki, Mari Fujimura, Tetsuro Nishino. ijsinnov, 4(2):58-70, 2016. [doi]

2015

2014

A source code plagiarism detecting method using alignment with abstract syntax tree elementsHiroshi Kikuchi, Takaaki Goto, Mitsuo Wakatsuki, Tetsuro Nishino. snpd 2014: 1-6 [doi]

2013

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational ExperimentsEtsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki. ieicet, 96-D(6):1286-1298, 2013. [doi]

A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final StateMitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino. snpd 2013: 459-465 [doi]

2010

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum CliqueEtsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki. walcom 2010: 191-203 [doi]

Polynomial Time Identification of Strict Prefix Deterministic Finite State TransducersMitsuo Wakatsuki, Etsuji Tomita. icgi 2010: 313-316 [doi]

2008

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive DataMitsuo Wakatsuki, Etsuji Tomita. ieicet, 91-D(6):1704-1718, 2008. [doi]

2006

A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive DataMitsuo Wakatsuki, Etsuji Tomita, Go Yamada. icgi 2006: 161-174 [doi]

2004

Polynomial time learning of simple deterministic languages via queries and a representative sampleYasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada. TCS, 329(1-3):203-221, 2004. [doi]

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive DataMitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita. icgi 2004: 260-272 [doi]

1997

A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluationsEtsuji Tomita, Ken ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki. scjapan, 28(5):60-67, 1997. [doi]

1995

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final StateKen Higuchi, Mitsuo Wakatsuki, Etsuji Tomita. ieicet, 78-D(8):939-950, 1995. [doi]

A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter AutomataKen Higuchi, Etsuji Tomita, Mitsuo Wakatsuki. ieicet, 78-D(4):305-313, 1995. [doi]

Sign in or sign up to see more results.

runs on WebDSL