| 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 | 2023-05-10 14:30 |
Hokkaido | Hokkaido University | [Invited Talk]
Reallocation Problems with Minimum Completion Time Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.)  COMP2023-1 |
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] | COMP2023-1 p.1 |
| COMP | 2022-10-26 17:00 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | Computational Complexity of List Constructing Takashi Harada (Kochi Univ. of Tech.), Takashi Fuchino, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (MIT) COMP2022-20 |
Packet classification is to classify packets arriving to or leaving from a network device according to the security polic... [more] | COMP2022-20 pp.32-37 |
| COMP | 2019-12-13 14:10 |
Gunma | Ikaho Seminar House, Gunma University | Computational Complexity of Relaxed Optimal Rule Ordering Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2019-36 |
The packet classification aims to determine the behavior of the incoming packets of network devices. The linear search c... [more] | COMP2019-36 pp.47-54 |
| COMP | 2019-10-25 14:15 |
Hokkaido | Sapporo Campus, Hokkaido University | Computational Complexity of Whitelist Constructing Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.) COMP2019-23 |
Packet classification is to classify packets arriving a network equipment according to the classification policy. It is ... [more] | COMP2019-23 pp.39-46 |
| COMP | 2019-10-25 14:40 |
Hokkaido | Sapporo Campus, Hokkaido University | A Rule Reordering Method via Deleting 0 Weights Rules Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech.), Tanaka Ken (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2019-24 |
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] | COMP2019-24 pp.47-52 |
| ISEC, COMP | 2017-12-21 11:50 |
Kochi | Eikokuji Campus, Kochi University of Technology | Maximum k-path Vertex Cover Problem on Graph Classes Tsuyoshi Yagita, Eiji Miyano, Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht U.) ISEC2017-76 COMP2017-30 |
This paper introduces the maximum version of the $k$-path vertex cover problem, called the textsc{Maximum $k$-Path Verte... [more] | ISEC2017-76 COMP2017-30 pp.25-31 |
| CAS, ICTSSL | 2017-01-26 11:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | On Relevance between an Edge Load Factor Balancing Problem and the Conventional NP-complete Problems Hikaru Kasuga, Masashi Yamada, Norihiko Shinomiya (Soka Univ.) CAS2016-83 ICTSSL2016-37 |
This paper analyzes the property of Edge Load factor Balancing (ELB) problem, which is one of network flow optimization ... [more] | CAS2016-83 ICTSSL2016-37 pp.33-36 |
| MSS, CAS, IPSJ-AL [detail] | 2016-11-25 09:50 |
Hyogo | Kobe Institute of Computing | On the Complexity of Finding a Largest Common Subtree of Trees Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-70 MSS2016-50 |
The largest common subtree problem (LCST) is to find a tree with the maximum number of edges that is a subtree of all th... [more] | CAS2016-70 MSS2016-50 pp.89-92 |
| COMP | 2016-04-22 14:00 |
Nara | Proposal of a Fast Heuristic for the Minimum Weight Vertex Cover Problem Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2016-4 |
Given an undirected graph with weight for each vertex, the minimum weight vertex cover problem (MWVCP) is an NP-hard p... [more] |
COMP2016-4 pp.23-28 |
|
| COMP | 2015-10-02 10:00 |
Tokyo | Upper and lower bounds and time complexities on the Frobenius problem obtained from analysing its additive structure Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2015-22 |
In this work, we investigate upper and lower bounds for the Frobenius problem, using some existing results in additive c... [more] | COMP2015-22 pp.1-5 |
|
| NS, IN (Joint) |
2014-03-07 08:50 |
Miyazaki | Miyazaki Seagia | Sever Location Method for Keeping Shorter Distance from Clients to Servers during Failures Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-243 |
Recently, large contents in the Internet have increased loads of contents servers, networks and data centers which may d... [more] | NS2013-243 pp.385-390 |
| COMP | 2013-03-18 15:15 |
Gifu | Gifu University | A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2012-59 |
Given a vertex-weighted undirected graph, the problem to find the clique of maximum weight is the maximum weight clique ... [more] | COMP2012-59 pp.47-53 |
| NS, IN (Joint) |
2013-03-07 11:50 |
Okinawa | Okinawa Zanpamisaki Royal Hotel | Network Design Method Based on Mathematical Programming
-- A Study to Improve Scalability -- Kentaro Ishibashi (QNET), Satoshi Imai (Fujitsu Laboratories), Yuzo Kusakabe (QNET), Akiko Yamada, Toshio Soumiya (Fujitsu Laboratories) NS2012-199 |
Network design methods based on Mathematical Programming have been attracting attention for complicated network construc... [more] | NS2012-199 pp.197-202 |
| NS, IN (Joint) |
2013-03-08 13:40 |
Okinawa | Okinawa Zanpamisaki Royal Hotel | Method for Finding Links Protected for Keeping the Shorter Distance from Clients to Servers during Failures Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-251 |
Recently, large-volume contents distributed by a content delivery network~(CDN) on the Internet increase load of content... [more] | NS2012-251 pp.499-504 |
| NS, IN (Joint) |
2013-03-08 14:00 |
Okinawa | Okinawa Zanpamisaki Royal Hotel | Method for Finding Links Protected to Keep Reachability to Server during Simultaneous Two Links Failures Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-252 |
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] | NS2012-252 pp.505-510 |
| NS, IN (Joint) |
2013-03-08 13:00 |
Okinawa | Okinawa Zanpamisaki Royal Hotel | Method for Finding Links Protected against Increase of Path Length during Failures Kohei Nishida, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-265 |
A telecommunication network should be reliable, since it is important as social infrastructure. However, in many actual ... [more] | NS2012-265 pp.583-588 |
| CAS, CS, SIP | 2012-03-09 14:45 |
Niigata | The University of Niigata | Performance Comparison of Heuristic Algorithms for the Graph Coloring Problem Yuta Koshin, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2011-145 SIP2011-165 CS2011-137 |
Graph coloring is an assignment of colors to vertices of a given undirected graph G=(V,E) such that any pair of adjacent... [more] | CAS2011-145 SIP2011-165 CS2011-137 pp.213-218 |
| IN, NS (Joint) |
2011-03-03 08:40 |
Okinawa | Okinawa Convention Center | Method for Finding Links Protected for Network Load Balancing during Failures Akira Noguchi, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010-173 |
The internet reliability is needed as the Internet becomes an important social infrastructure. However, we face the ris... [more] | NS2010-173 pp.57-62 |
| IN, NS (Joint) |
2011-03-03 09:20 |
Okinawa | Okinawa Convention Center | Method for Finding Links Protected to Keep Reachability to Server during Failures Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010-175 |
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] | NS2010-175 pp.69-74 |
| MSS, CAS | 2010-11-18 13:00 |
Osaka | Kansai Univ. | On the Complexity of Three-Dimensional Orthogonal Face Routing Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2010-68 CST2010-41 |
The 3-D switchbox routing is a fundamental problem on the physical design of 3-D integrated circuits. The 3-D channel is... [more] | CAS2010-68 CST2010-41 pp.19-24 |
[Return to Top Page]