Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP, IPSJ-AL |
2024-05-09 11:35 |
Kyoto |
Kyoto University (Rakuyu-kaikan) |
Online Exploration of Rectilinear Polygons by Multiple Searchers Taro Abe, Yuya Higashikawa, Shuichi Miyazaki (Univ. of Hyogo) |
(To be available after the conference date) [more] |
|
COMP |
2020-10-23 15:40 |
Osaka |
Osaka Univ. (Primary: On-site, Secondary: Online) |
Optimal online packet scheduling for 2-bounded delay buffer management with lookahead Koji M. Kobayashi (UT) COMP2020-15 |
The bounded delay buffer management problem proposed by Kesselman et~al. (STOC 2001 and SIAM Journal on Computing 33(3),... [more] |
COMP2020-15 pp.26-32 |
COMP |
2014-04-24 15:15 |
Miyagi |
Tohoku University |
Improved Bounds for Online $k$-Frame Throughput Maximization in Network Switches Koji Kobayashi (NII), Jun Kawahara (NAIST), Shuichi Miyazaki (Kyoto Univ.) COMP2014-6 |
We consider a variant of the online buffer management problem in network switches, called the $k$-frame throughput maxim... [more] |
COMP2014-6 pp.37-44 |
COMP |
2010-12-03 16:00 |
Fukuoka |
Kyutech Plaza, Kyushu Institute of Technology |
Improving the Competitive Ratios of the Seat Reservation Problem Kazuya Okamoto, Shuichi Miyazaki (Kyoto Univ.) COMP2010-45 |
In the seat reservation problem, there are $k$ stations, $s_{1}$
through $s_{k}$, and one train with $n$ seats departin... [more] |
COMP2010-45 pp.45-51 |
COMP |
2010-03-12 15:50 |
Tokyo |
National Institute of Informatics |
Online graph exploration algorithms for cycles and trees by multiple number of searchers Yuya Higashikawa, Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.), Stefan Langerman (ULB) COMP2009-57 |
This paper deals with online graph exploration problems by multiple searchers. The purpose of search is to visit all ver... [more] |
COMP2009-57 pp.49-56 |
COMP |
2010-01-25 09:30 |
Fukuoka |
Nishijin Plaza, Kyushu University |
Competitive Analysis of the k-Canadian Traveller Problem for Graphs with Restricted Edge Weights Takeshi Fukuda, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP2009-39 |
The $k$-Canadian Traveller Problem ($k$-CTP) is one of the online problems.
In this problem, we are given an undirected... [more] |
COMP2009-39 pp.1-8 |
COMP |
2008-09-11 16:40 |
Aichi |
Nagoya Inst. of Tech. |
Improved Competitive Ratios of Online Buffer Management Algorithms for Multi-Queue Switches in QoS Networks Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP2008-33 |
The online buffer management problem formulates the problem of queuing
policies of network switches supporting QoS (Qua... [more] |
COMP2008-33 pp.71-78 |
COMP |
2007-09-20 15:50 |
Aichi |
|
An Optimal Online Algorithm for the Graph Exploration Problem on Cycles Naoyuki Morimoto, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP2007-39 |
The purpose of the online graph exploration problem is to visit all
the nodes of a given graph and come back to the sta... [more] |
COMP2007-39 pp.51-57 |
COMP |
2005-06-24 13:15 |
Toyama |
|
Improving competitive ratios of online buffer management for shared-memory switches Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) |
The buffer management problem is a kind of online problems, which
formulates the problem of queueing policies of networ... [more] |
COMP2005-21 pp.17-22 |