IEICE Technical Report

Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2009-09-14 / Issue Date : 2009-09-07

COMP2009-25
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata
Tomoyuki Yamakami (Univ. of Fukui.)
pp. 1 - 8

COMP2009-26
Recognition of a Spanning Tree of DAGs by Tree Automata
Akio Fujiyoshi (Ibaraki Univ.)
pp. 9 - 12

COMP2009-27
Adversarial Bandit Problems with Multiple Plays
Taishi Uchiya, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaidou Univ.)
pp. 13 - 20

COMP2009-28
Parameter acquisition of an evaluation function for games by reinforcement learning
Yasuhiro Tajima (Okayama Pref Univ.)
pp. 21 - 26

COMP2009-29
On the possible patterns of inputs for block sorting
Takashi Saso, Kojiro Kobayashi (Soka Univ.)
pp. 27 - 33

COMP2009-30
Random Generation and Enumeration of Bipartite Permutation Graphs
Toshiki Saitoh (JAIST), Yota Otachi (Gunma Univ.), Katsuhisa Yamanaka (Univ. of Electro-Comm), Ryuhei Uehara (JAIST)
pp. 35 - 42

COMP2009-31
A Rooted-forest Partition with Uniform Vertex Demand and Its Application to the Rigidity Theory
Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.)
pp. 43 - 50

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan