| 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, MSS | 2024-03-14 11:15 |
Misc. | Kikai-Shinko-Kaikan Bldg. | Parallelization of a Search Algorithm for Regular Graphs with Minimum Average Shortest Path Length Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  MSS2023-89 NLP2023-141 |
Computer networks in data centers are modeled as regular graphs, and the average shortest path length (ASPL) of such a g... [more] | MSS2023-89 NLP2023-141 pp.87-92 |
| CCS, NLP | 2022-06-09 17:40 |
Osaka | (Primary: On-site, Secondary: Online) |
Speeding up an algorithm for searching generalized Moore graphs Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2022-11 CCS2022-11 |
Computer networks in data centers are modeled as undirected regular graphs, and the average shortest path length (ASPL) ... [more] | NLP2022-11 CCS2022-11 pp.52-57 |
| NLP | 2020-05-15 13:00 |
Online | Online | A Genetic Algorithm for Minimizing Average Shortest Path Length of Regular Graphs Reiji Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-3 |
For the problem of finding a regular graph with given order and degree that minimizes the average shortest path length, ... [more] | NLP2020-3 pp.11-16 |
| NLP, CCS | 2018-06-10 11:20 |
Kyoto | Kyoto Terrsa | Some Efficient Methods for Searching Generalized Moore Graphs Yoshiki Satotani, Norikazu Takahashi (Okayama Univ.) NLP2018-43 CCS2018-16 |
Computer networks used for high performance computing are often modeled by undirected regular graphs, and the average sh... [more] | NLP2018-43 CCS2018-16 pp.85-90 |
| MBE, NC, NLP (Joint) |
2018-01-26 13:25 |
Fukuoka | Kyushu Institute of Technology | Methods for Constructing Simple Undirected Regular Graphs Based on Generalized de Bruijn Graphs Ryoya Ishii, Norikazu Takahashi (Okayama Univ.) NLP2017-90 |
The Generalized de Bruijn Graphs (GDBG) are a class of directed regular graphs. Since the average shortest path length o... [more] | NLP2017-90 pp.23-28 |
| COMP, ISEC | 2016-12-21 15:30 |
Hiroshima | Hiroshima University | Theoretical Model of Interconnection Networks Consisting of Hosts and Switches Ryota Yasudo (Keio Univ.), Michihiro Koibuchi (NII), Hideharu Amano (Keio Univ.), Koji Nakano (Hiroshima Univ.) ISEC2016-79 COMP2016-40 |
Designing interconnection networks with low average shortest path length (ASPL) is an important object for researchers o... [more] | ISEC2016-79 COMP2016-40 pp.51-58 |
| DC, CPSY | 2015-04-17 14:15 |
Tokyo | Parallel Processor Architecture based on Small World Connection Hideki Mori (Meiji Univ.), Minoru Uehara, Katsuyoshi Matsumoto (Toyo Univ.) CPSY2015-10 DC2015-10 |
The technology of circuit refinement has achieved a tremendous large-scale integration, so huge VLSI systems have emerge... [more] | CPSY2015-10 DC2015-10 pp.53-58 |
|
| NLP | 2015-03-03 13:25 |
Hyogo | Hyogo Prefecture Citizens' Hall | Methods of Generating Regular Graphs with Short Average Path Length Keisuke Fujita, Norikazu Takahashi (Okayama Univ.) NLP2014-144 |
The problem of finding a regular graph with given number of vertices and given degree that minimizes the average path le... [more] | NLP2014-144 pp.7-12 |
| CS, OCS (Joint) |
2014-01-23 11:20 |
Tokyo | Hajijo-jima Ohgagou Kouminkan | Autonomous Distributed Resource Allocations Using Time-Series Data of Wavelength Usage for Optical Packet and Circuit Integrated Networks Takaya Miyazawa, Hideaki Furukawa, Naoya Wada, Hiroaki Harai (NICT) CS2013-101 |
We propose and implement an enhanced moving average (MA) based dynamic resource allocation method for optical packet and... [more] | CS2013-101 pp.97-102 |
| NLP | 2013-05-27 14:15 |
Fukuoka | Event hall, Central Library, Fukuoka University | Dynamics of Particle Swarm Optimization and Its Network Structure Kenya Jin'no (Nippon Inst. of Tech.) NLP2013-12 |
This article analyzes the convergence property of the particle swarm optimization. The inter-particle communication of t... [more] | NLP2013-12 pp.17-20 |
| AP | 2010-04-09 15:40 |
Kyoto | Doshisha Univ. | Prevention of False Detection due to Grating Lobes in Estimating Pedestrian Direction Using a Vehicle-Mounted Array Antenna Toshihiro Noba, Yasutaka Ogawa, Toshihiko Nishimura, Takeo Ohgane (Hokkaido Univ.) AP2010-10 |
Some techniques using intelligent transport systems have been studied to prevent traffic accidents whose victims are a p... [more] | AP2010-10 pp.47-51 |
| PN, CS, OCS (Joint) |
2005-05-24 15:40 |
Okinawa | Hotel Moonbeach (Okinawa) | Aggressive Rank Accounting using Wavelength-State Information of Multiple Routes in Multi-Domain WDM Networks Takuji Tachibana, Hiroaki Harai (NICT) |
In multi-domain WDM networks, a lightpath establishment method based on rank accounting has been proposed.In this meth... [more] |
PN2005-18 pp.63-68 |
[Return to Top Page]