| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| 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 | 2017-03-07 14:50 |
Aichi | Nanzan University | An Optimal Online Graph Search Algorithm in terms of the Number of Searchers Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.)  COMP2016-54 |
The graph search problem is the problem of searching for a mobile evader in a graph by mobile searchers.The edge search ... [more] | COMP2016-54 pp.21-28 |
| IBISML | 2016-11-17 14:00 |
Kyoto | Kyoto Univ. | Extraction of Cluster Structural Changes using Variational Bayes Daisuke Kaji (Denso), Kazuho Watanabe (Toyohashi Tech.) IBISML2016-78 |
Variational Bayes learning (VB) is widely applied to clustering problems as the low computational cost algorithm of Baye... [more] | IBISML2016-78 pp.229-233 |
| NS, IN (Joint) |
2016-03-04 15:05 |
Miyazaki | Phoenix Seagaia Resort | Performance Improvement of an On-line Server Location Decision Algorithm in Server Migration Service Hiromichi Sugiyama, Yukinobu Fukushima (Okayama Univ.), Gen Motoyoshi (NEC), Tutomu Murase (Nagoya Univ.), Tokumi Yokohira (Okayama Univ.) NS2015-253 |
Server migration service (SMS) has been proposed as an optional service that can improve QoS of communications by networ... [more] | NS2015-253 pp.493-498 |
| ICM, CQ, NS, NV (Joint) |
2014-11-14 09:50 |
Kochi | Kochi-City-Culture-Plaza CUL-PORT | An On-line Server Location Decision Algorithm in Server Migration Service Yuta Hoshino, Yukinobu Fukushima (Okayama Univ.), Tutomu Murase (NEC), Tokumi Yokohira (Okayama Univ.), Tatsuya Suda (University Netgroup) NS2014-138 |
Server migration service (SMS) is proposed as an optional service that can improve QoS of communications by network appl... [more] | NS2014-138 pp.59-64 |
| IBISML | 2011-03-28 14:40 |
Osaka | Nakanoshima Center, Osaka Univ. | An Online Algorithm for Classification Using Coding Divergence Tadashi Yoshioka, Mahito Sugiyama, Akihiro Yamamoto (Kyoto Univ.) IBISML2010-117 |
In this paper, we construct an online algorithm for classification of real-valued data adopting coding divergence, which... [more] | IBISML2010-117 pp.93-100 |
| 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 | 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-10-19 09:35 |
Miyagi | Tohoku Univ. | Automated Competitive Analysis of Online Problems Takashi Horiyama, Kazuo Iwama, Jun Kawahara (Kyoto Univ.) |
In this paper we study the 2-Bin Exchangeable Online Knapsack Problem (2EOK) which is an extension of the 2-Bin Removab... [more] |
COMP2005-45 pp.7-12 |
| 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 |
|
| CAS | 2005-01-19 11:10 |
Ishikawa | Kanazawa Univ | Competitive Online Data Migration Algorithm On Rings Ryosuke Ito, Akira Matsubayashi (Kanazawa Uni.) |
Data migration problem is, given a network $G$, a node $a_{0}$ of $G$ which holds a data $x$ of size $D$ initially, and ... [more] | CAS2004-62 pp.13-17 |
[Return to Top Page]