Sun, Mar 1 10:00 - 17:40 |
(1) |
10:00-10:25 |
Algorithms for uniform deployment of mobile agents in dynamic rings |
Masahiro Shibata (Kyutech), Yuichi Sudo (Osaka Univ.), Junya Nakamura (Toyohashi Tech), Yonghwan Kim (NITech) |
(2) |
10:25-10:50 |
On a Filling Algorithm for an Autonomous Mobile Pair-Robot System in SSYNC Scheduler |
Yamada Ryoto, Yonghwan Kim, Yoshiaki Katayama (Nagoya Inst. of Tech.) |
(3) |
10:50-11:15 |
Creating an Apple Watch sales forecasting system that analyzes Twitter |
Yoshiaki Yagi, Mitsuhiro Iyoda (CIT) |
|
11:15-11:30 |
Break ( 15 min. ) |
(4) |
11:30-12:30 |
[Invited Talk]
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs |
Takuro Fukunaga (Chuo Univ.) |
|
12:30-14:00 |
Lunch Break ( 90 min. ) |
(5) |
14:00-14:25 |
Metric Dimension on Some Classes of Chordal Graphs |
Ryoga Katoh, Remy Belmonte (UEC) |
(6) |
14:25-14:50 |
On Approximation Algorithms for Power Vertex Cover Problem |
Takumi Tatematsu, Tetsuro Rintani, Toshihiro Fujito (TUT) |
(7) |
14:50-15:15 |
Minmax regret 1-sink problem with parametric weights |
Yuki Tokuni (Kwansei Gakuin Univ.), Noaki Katoh, Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie (Univ. of Hyogo) |
(8) |
15:15-15:40 |
Efficient algorithm for simulating an unbiased coin tossing with a baiased coin |
Koji Ueno, Ryuhei Uehara (JAIST) |
|
15:40-16:00 |
Break ( 20 min. ) |
(9) |
16:00-16:25 |
Information theoretic lower bound of Hasse diagrams with degree constraint |
Jumpei Mori, Jun Kawahara, Shinichi Minato (Kyoto Univ.) |
(10) |
16:25-16:50 |
Synchronizing Pushdown Automata and Reset Words |
Eitatsu Mikami, Tomoyuki Yamakami (Univ. Fukui) |
(11) |
16:50-17:15 |
Online Learning for A Repeated Markovian Game with 2 States |
Shangtong Wang, Shuji Kijima (Kyushu Univ.) |
(12) |
17:15-17:40 |
Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning |
Mikito Nanashima (Tokyo Tech) |