IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 19件中 1~19件目  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
IA, IPSJ-IOT, SITE [detail] 2015-03-06
10:15
Fukushima   Evaluation of Greedy Algorithms for Embedding Multiple VLANs
Andrew Lee, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
Given the same amount of hardware resource and bandwidth limitation, networks with optimal configurations enable Interne... [more] SITE2014-73 IA2014-105
pp.143-147
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.)
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
IA, IPSJ-IOT, SITE [detail] 2014-02-27
16:25
Ishikawa Hotel Rurikoh An Efficient Judging Method of a Large Amount of E-mails Having the Same Sender and Recipient Addresses
Yoshiharu Tsuzaki, Ryosuke Matsumoto, Daisuke Kotani, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
With the wide use of e-mail, it has become commonly expected that e-mails are delivered to recipients immediately. It is... [more] SITE2013-62 IA2013-87
pp.61-66
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.)
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
IA 2010-11-24
15:35
Yamanashi Seisen-Ryo Design of a Certified E-mail System without a Trusted Third Party
Satoshi Ishibashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
These days, as e-mails become more and more important, the demand for certified e-mail is growing. Methods for certified... [more] IA2010-54
pp.19-24
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.)
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 2009-10-16
15:25
Miyagi Tohoku University An Improved Approximation Lower Bound for Maximum Cardinality Almost Stable Matching Problem
Koki Hamada, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.)
In the stable marriage problem that allows incomplete preference
lists, all stable matchings for a given instance have ... [more]
COMP2009-37
pp.35-40
AI 2009-09-25
13:00
Kyoto Kyoto Univ. Clock Tower [Invited Talk] Recent Topics on the Stable Matching Problems
Shuichi Miyazaki (Kyoto Univ.)
In the stable matching problem, we are given a set of men and women, and each person's preference list that orders membe... [more] AI2009-12
pp.19-22
IA 2008-11-05
14:30
Toyama Tateyama Kokusai Hotel Designing a certified mail exchnage protocol using gradual secret exchanging protocols
Keita Shimizu, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
These days, we more and more depends on e-mails and demands on certified e-mail is growing.
However some commercial ser... [more]
IA2008-42
pp.7-12
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.)
The online buffer management problem formulates the problem of queuing
policies of network switches supporting QoS (Qua... [more]
COMP2008-33
pp.71-78
COMP 2008-03-10
09:30
Kanagawa   Approximation Algorithms for the Sex-Equal Stable Marriage Problem
Hiroki Yanagisawa (IBM), Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.)
The stable marriage problem is a classical matching problem introduced
by Gale and Shapley. It is known that for any i... [more]
COMP2007-55
pp.1-8
COMP 2007-10-16
10:40
Miyagi Tohoku Univ. NP-Completeness of the Stable Roommates Problem with Triple Rooms
Kazuya Okamoto, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.)
 [more] COMP2007-41
pp.1-6
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.)
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 2007-06-29
15:05
Hokkaido Hokkaido University A Tight Upper Bound on Online Buffer Management for Two-port Shared-Memory Switches
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)
The online buffer management problem formulates the problem of queueing
policies of network switches supporting QoS (Q... [more]
COMP2007-26
pp.63-70
COMP 2006-12-04
10:00
Aichi Nagoya University weighted nearest neighbor algorithms for the graph exploration problem on cycles
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.), Takuro Yoshimuta (KIT)
 [more] COMP2006-43
pp.15-22
COMP 2006-12-04
16:35
Aichi Nagoya University 1.875-approximation algorithm for the stable marriage problem
Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.)
 [more] COMP2006-48
pp.49-56
COMP 2006-06-23
10:35
Saitama Saitama Univ. On the Computational Complexity of Interview Timetabling Problems
Yuuki Kiyonari, Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.)
 [more] COMP2006-18
pp.7-14
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
COMP 2005-05-20
15:30
Fukuoka Kyushu Univ. Improving a local search approximation algorithm for the stable marriage problem
Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.)
We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowe... [more] COMP2005-15
pp.45-51
 19件中 1~19件目  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan