Mon, Sep 14 AM 10:40 - 11:50 |
(1) |
10:40-11:15 |
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata |
Tomoyuki Yamakami (Univ. of Fukui.) |
(2) |
11:15-11:50 |
Recognition of a Spanning Tree of DAGs by Tree Automata |
Akio Fujiyoshi (Ibaraki Univ.) |
|
11:50-13:00 |
Lunch Break ( 70 min. ) |
Mon, Sep 14 PM 13:00 - 14:10 |
(3) |
13:00-13:35 |
Adversarial Bandit Problems with Multiple Plays |
Taishi Uchiya, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaidou Univ.) |
(4) |
13:35-14:10 |
Parameter acquisition of an evaluation function for games by reinforcement learning |
Yasuhiro Tajima (Okayama Pref Univ.) |
|
14:10-14:30 |
Break ( 20 min. ) |
Mon, Sep 14 PM 14:30 - 16:15 |
(5) |
14:30-15:05 |
On the possible patterns of inputs for block sorting |
Takashi Saso, Kojiro Kobayashi (Soka Univ.) |
(6) |
15:05-15:40 |
Random Generation and Enumeration of Bipartite Permutation Graphs |
Toshiki Saitoh (JAIST), Yota Otachi (Gunma Univ.), Katsuhisa Yamanaka (Univ. of Electro-Comm), Ryuhei Uehara (JAIST) |
(7) |
15:40-16:15 |
A Rooted-forest Partition with Uniform Vertex Demand and Its Application to the Rigidity Theory |
Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.) |
|
- |
|