Online edition: ISSN 2432-6380
[TOP] | [2016] | [2017] | [2018] | [2019] | [2020] | [2021] | [2022] | [Japanese] / [English]
COMP2019-45
Algorithms for uniform deployment of mobile agents in dynamic rings
Masahiro Shibata (Kyutech), Yuichi Sudo (Osaka Univ.), Junya Nakamura (Toyohashi Tech), Yonghwan Kim (NITech)
pp. 1 - 8
COMP2019-46
On a Filling Algorithm for an Autonomous Mobile Pair-Robot System in SSYNC Scheduler
Yamada Ryoto, Yonghwan Kim, Yoshiaki Katayama (Nagoya Inst. of Tech.)
pp. 9 - 16
COMP2019-47
Creating an Apple Watch sales forecasting system that analyzes Twitter
Yoshiaki Yagi, Mitsuhiro Iyoda (CIT)
pp. 17 - 21
COMP2019-48
[Invited Talk]
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs
Takuro Fukunaga (Chuo Univ.)
p. 23
COMP2019-49
Metric Dimension on Some Classes of Chordal Graphs
Ryoga Katoh, Remy Belmonte (UEC)
pp. 25 - 28
COMP2019-50
On Approximation Algorithms for Power Vertex Cover Problem
Takumi Tatematsu, Tetsuro Rintani, Toshihiro Fujito (TUT)
pp. 29 - 33
COMP2019-51
Minmax regret 1-sink problem with parametric weights
Yuki Tokuni (Kwansei Gakuin Univ.), Noaki Katoh, Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie (Univ. of Hyogo)
pp. 35 - 41
COMP2019-52
Efficient algorithm for simulating an unbiased coin tossing with a baiased coin
Koji Ueno, Ryuhei Uehara (JAIST)
pp. 43 - 49
COMP2019-53
Information theoretic lower bound of Hasse diagrams with degree constraint
Jumpei Mori, Jun Kawahara, Shinichi Minato (Kyoto Univ.)
pp. 51 - 56
COMP2019-54
Synchronizing Pushdown Automata and Reset Words
Eitatsu Mikami, Tomoyuki Yamakami (Univ. Fukui)
pp. 57 - 63
COMP2019-55
Online Learning for A Repeated Markovian Game with 2 States
Shangtong Wang, Shuji Kijima (Kyushu Univ.)
pp. 65 - 68
COMP2019-56
Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning
Mikito Nanashima (Tokyo Tech)
pp. 69 - 76
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.