| 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 # | |
| NLP | 2013-10-29 16:45 |
Kagawa | Sanport Hall Takamatsu | Solving Shortest Path Problems of Complex Networks Using Adaptable Independent-minded Particle Swarm Optimization Yoko Ishii, Haruna Matsushita (Kagawa Univ.)  NLP2013-109 |
The Shortest Path Problem (SPP) is one of the most fundamental problems in graph theory. The purpose of this study is to... [more] | NLP2013-109 pp.211-214 |
| COMP | 2013-06-24 10:35 |
Nara | Nara Women's University | Shortest Path Queries by Labeling for Paths with Pruning in Road Networks Yuki Kawata, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-20 |
Shortest-Path problem is a fundamental problem in road networks and a lot of methods are proposed. In the labeling appro... [more] | COMP2013-20 pp.7-15 |
| NS | 2013-04-19 14:20 |
Ishikawa | The Wajima Chamber of Commerce and Industry | Optimal Multiple Shared Multicast Trees for Many-to-Many Multicasting Communication Shanming Zhang, Hidetoshi Takeshita (Keio Univ.), Takashi Kurimoto (NTT), Satoru Okamoto, Naoaki Yamanaka (Keio Univ.) NS2013-10 |
Multicast, which provides an efficient way of disseminating data from a source to all the members in a multicast group, ... [more] | NS2013-10 pp.49-54 |
| NLP | 2013-03-15 10:40 |
Chiba | Nishi-Chiba campus, Chiba Univ. | Response of an External Force in the Network Optimization Method Mimicking the True Slime Mold Naohiro Takagi, Kuniyasu Shimizu (Chiba Inst. of Tech.) NLP2012-164 |
In this study, we apply an external trapezoid force to the shortest path finding method mimicking the true slime mold, a... [more] | NLP2012-164 pp.103-107 |
| EE, CPM | 2013-01-25 15:20 |
Kumamoto | Analysis of Electric Vehcle Battery Change Station Placement and Availability Shogo Mukai, Marat Zhanikeev, Hitoshi Watanabe (Tokyo Univ. of Science) EE2012-55 CPM2012-177 |
With growth in the number of electric vehicles (EV), battery charging infrastructure is also expected to grow. Solving t... [more] | EE2012-55 CPM2012-177 pp.159-162 |
|
| COMP | 2012-03-16 14:10 |
Tokyo | Univ. of Tokyo | Sublinear Space Algorithm for Shortest Path Problem on Grid Graph Tatsuya Imai, Shunsuke Noguchi, Tetsuro Fuji (Titech) COMP2011-52 |
The shortest path problem is one of the most important problem in computer science and has many practical applications, ... [more] | COMP2011-52 pp.39-44 |
| COMP | 2011-10-21 10:00 |
Miyagi | Tohoku Univ. | Memory-Constrained Algorithms for Shortest Path Problem Tetsuo Asano (JAIST), Benjamin Doerr (MPI) COMP2011-28 |
This paper presents a space-efficient algorithm for finding a shortest path in a grid graph whose size is $\sqrt{n}\tim... [more] |
COMP2011-28 pp.1-5 |
| ISEC, IT, WBS | 2011-03-03 17:00 |
Osaka | Osaka University | A Dynamic Programming of Joint Source-Channel Coding for Discrete Memoryless Sources and (d,k)-constrained Channels using Monge Property Takuya Koyama, Ken-ichi Iwata (Univ of Fukui) IT2010-84 ISEC2010-88 WBS2010-63 |
We consider a problem to build good prefix-free codes for stationary memoryless sources over finite-state noiseless ch... [more] |
IT2010-84 ISEC2010-88 WBS2010-63 pp.99-104 |
| COMP | 2010-10-15 10:05 |
Miyagi | Tohoku Univ. | Constant-Work-Space Algorithms for Geometric Problems(2) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP2010-32 |
We present space-efficient algorithms for geometric problems in a restricted computational model called ``constant wor... [more] | COMP2010-32 pp.9-15 |
| COMP | 2010-09-29 10:00 |
Niigata | Nagaoka Univ. of Tech. | Run-time Analysis of Ant Colony Optimization over the Cheapest Path with a Context-dependent Cost Atsushi Murata, Yoshinori Takei (Nagaoka Univ. of Tech.) COMP2010-24 |
Since Ant Colony Optimization (ACO) was introduced by Dorigo and his colleagues in the early 1990s, it has been worked a... [more] | COMP2010-24 pp.1-8 |
| R | 2010-07-30 15:55 |
Yamagata | An Efficient Algorithm for the Partial Group of Pareto-Solutions at a Multi-Objective Network Tomoaki Akiba (Yamagata Coll. of Ind & Tech.), Liu Danqin, Hisashi Yamamoto (Tokyo Metro Univ.) R2010-23 |
The multi-objective network model can be applied to a well-known problems, which is the problem of finding the routing p... [more] | R2010-23 pp.37-41 |
|
| 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 |
| IT | 2009-05-29 14:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Constructing prefix-free codes for finite-state noiseless channels Takuya Koyama, Ken-ichi Iwata (Univ. of Fukui) IT2009-1 |
We consider a problem to build good prefix-free codes for stationary memoryless sources over finite-state noiseless chan... [more] | IT2009-1 pp.1-6 |
| ITE-HI, ITE-AIT, ITE-ME, IE, ITS | 2008-02-18 11:40 |
Hokkaido | Graduate School of Information Science and Technology Hokkaido Univ | Image Mosaicing Method with EM Algorithm Allowing Moving Objects Takeaki Iiyoshi, Wataru Mitsuhashi (UEC) ITS2007-39 IE2007-222 |
Image mosaicing is an effective means of constructing a photograph with a wide field of view from a series of images tak... [more] | ITS2007-39 IE2007-222 pp.19-24 |
| NS, RCS (Joint) |
2005-07-21 14:00 |
Okayama | Okayama Univ.(Tsushima Campus) | Design of Ad hoc Multicast Routing Protocol Using Shortest Path Trees Tsutomu Kozaka, Toshihiko Kato, Shuichi Itoh (UEC), Yoshiyori Urano (Waseda Univ.) |
In recent years, an ad hoc network is paid to attention, and many routing protocols are studied actively not only for un... [more] | NS2005-64 pp.13-16 |
[Return to Top Page]