Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NS |
2019-04-19 10:25 |
Kagoshima |
Tenmonkan Vision Hall |
Dynamic Network Slicing for Constructing Communication Network with High Fault Resistance Atsushi Miyaji, Yasuhiro Urayama (National Institute of Technology, Kochi College) NS2019-12 |
Since 2020, several kinds of services with the 5G, such as video streaming with VR(Virtual Reality) and auto driving sys... [more] |
NS2019-12 pp.67-72 |
CPSY, DC, IPSJ-ARC (Joint) [detail] |
2017-07-27 10:45 |
Akita |
Akita Atorion-Building (Akita) |
CPSY2017-24 |
(To be available after the conference date) [more] |
CPSY2017-24 pp.83-88 |
ED, SDM |
2017-02-24 11:50 |
Hokkaido |
Centennial Hall, Hokkaido Univ. |
A New Computing A New Computing Architecture Using Ising Spin Model Implemented on FPGA for Solving Combinatorial Optimization ProblemsArchitecture by Ising Spin Model for Solving Combinatorial Optimization Problems Implemented on FPGA Yusuke Kihara, Mitsuki Ito, Takanari Saito, Masayuki Shiomura, Shotaro Sakai, Jun-ichi Shirakashi (Tokyo Univ. of Agr. & Tech.) ED2016-134 SDM2016-151 |
Recently, the new computing architecture using Ising spin model has been attracting considerable attention. It is well k... [more] |
ED2016-134 SDM2016-151 pp.23-28 |
NS, IN (Joint) |
2015-03-03 15:40 |
Okinawa |
Okinawa Convention Center |
An Analysis Study on the Impact of Network Topology on the Performance of TDMA-based Multihop Wireless Networks Kai Koyama, Go Hasegawa, Morito Matsuoka (Osaka Univ.) NS2014-274 |
In TDMA-based multihop wireless networks, we need to assign time slots to links according to their traffic load, that is... [more] |
NS2014-274 pp.571-576 |
RCS, NS (Joint) |
2014-12-19 13:30 |
Mie |
Iseshi-Kanko-Bunka-Kaikan (Mie) |
An Optimization Algorithm of AP Placement applying Particle Swarm Optimization in Wireless Mesh Networks Takuma Hoshi, Akio Koyama (Yamagata Univ.) NS2014-157 |
Wireless Mesh Networks (WMN) which connects among WLANs by wireless link can cover the wide area inexpensively and easil... [more] |
NS2014-157 pp.57-62 |
NLP |
2014-01-21 13:50 |
Hokkaido |
Niseko Park Hotel |
Solving Optimization Problems Using DS-net and IDL model Yuto Watanabe (Tohoku Univ.), Yoshihiro Hayakawa (SNCT), Shigeo Sato, Koji Nakajima (Tohoku Univ.) NLP2013-137 |
The Inverse function DelayLess (IDL) model has been proposed as one of novel neural models. Since the IDL model can set ... [more] |
NLP2013-137 pp.45-50 |
NLP |
2013-10-29 13:45 |
Kagawa |
Sanport Hall Takamatsu |
Fast Calculation of High functional Neural Network by using GPU Kouta Tanno (Tohoku Univ.), Yoshihiro Hayakawa (Sendai NCT) NLP2013-101 |
A GPU can compute in highly parallel because it has many cores (processing units). Though it is reported that a high fun... [more] |
NLP2013-101 pp.165-168 |
NLP |
2012-12-18 09:45 |
Fukui |
Fukui City Communication Plaza |
Inverse Function Delayless (IDL) Model Yuto Watanabe (Tohoku Univ.), Yoshihiro Hayakawa (SNCT), Shigeo Sato, Koji Nakajima (Tohoku Univ.) NLP2012-98 |
The Inverse function Delayed (ID) model has been proposed as one of novel neural models. The ID model has the negative r... [more] |
NLP2012-98 pp.57-60 |
NC |
2012-10-04 17:45 |
Fukuoka |
Kyushu Institute of Technology (Wakamatsu Campus) |
An Application of the Virtual Magnetic Diminuendo Method to Combinatorial Optimization Problems
-- Towards Autonomous System for Effective Assignment -- Hiroshi Wakuya, Taichi Inoue, Hideaki Itoh, Hisao Fukumoto, Tatsuya Furukawa (Saga Univ.) NC2012-48 |
In general, there are quite a lot of constraints, when we try to solve actual combinatorial optimization problems. A fa... [more] |
NC2012-48 pp.67-72 |
NLP |
2011-03-11 13:30 |
Tokyo |
Tokyo University of Science |
Higher order neural network with stochastic logic Takahiro Sota (Tohoku Univ.), Yoshihiro Hayakawa (Sendai National College of Technology), Shigeo Sato, Koji Nakajima (Tohoku Univ.) NLP2010-189 |
We have proposed the method to solve various combinatorial optimization problems such as Traveling Salesman Problems (TS... [more] |
NLP2010-189 pp.149-152 |
NLP |
2010-11-20 10:55 |
Miyagi |
Tohoku University (RIEC) |
A Modular Neural Network for Parallel Computation Daisuke Sasaki, Yoshihiro Hayakawa (Sendai NCT) NLP2010-110 |
Some of combinatorial optimization problems cause exponential increases of calculation time in terms of a problem size. ... [more] |
NLP2010-110 pp.55-60 |
NLP |
2010-03-10 15:15 |
Tokyo |
|
Discrete Time Inverse Function Delayed Network with Higher-Order Connections Takahiro Sota, Koji Kurose (Tohoku Univ.), Yoshihiro Hayakawa (Sendai Nat Coll. of Tech.), Shigeo Sato, Koji Nakajima (Tohoku Univ.) NLP2009-181 |
The Inverse function Delayed network with higher-order connection (HCID network) has been proposed to solve combinatoria... [more] |
NLP2009-181 pp.131-136 |
KBSE |
2010-01-25 16:40 |
Tokyo |
Univ. of Tsukuba, Tokyo |
A Chinese poetry polish course as the issue of combination optimization with the limitation Muhnong Yu, Seiichi Komiya (Shibaura Inst. of Tech.) KBSE2009-52 |
[more] |
KBSE2009-52 pp.25-28 |
NLP |
2009-05-15 16:10 |
Shiga |
Ritsumeikan University |
Parameter Adjusting of the Chaotic Search Method to Multiple Sequence Alignment Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2009-10 |
An algorithm for solving combinatorial optimization problems by chaotic neurodynamics has already been proposed and exhi... [more] |
NLP2009-10 pp.45-50 |
RECONF |
2009-05-14 15:10 |
Fukui |
|
Proposal and Implementation of High Throughput Algorithm for Combination Generation Akira Tsuji, Norio Yamagaki, Satoshi Kamiya (NEC) RECONF2009-5 |
Combinatorial optimization problems are widely exist.
Generally they are solved by approximate means like greedy method... [more] |
RECONF2009-5 pp.25-30 |
NLP |
2008-12-10 15:05 |
Ishikawa |
|
Autonomous Optimization of Wireless Networks based on Neural Network Dynamics Mikio Hasegawa, Taichi Takeda, Taro Kuroda (Tokyo Univ. of Science), Hiroshi Harada (National Institute of Information and Communications Technology) NLP2008-88 |
Various radio access technologies have been developed and commercialized. Since available frequency band for new wireles... [more] |
NLP2008-88 pp.95-100 |
NC |
2008-11-07 14:55 |
Saga |
Saga Univ. |
A Visualized Analysis on State Transition in Hopfield Network
-- An Application to Search Process of N Queens Problem -- Kiyotaka Yamashita, Hiroshi Wakuya (Saga Univ.) NC2008-60 |
A Hopfield network is a good tool for solving combinatorial optimization problems, but it sometimes reaches a poor solut... [more] |
NC2008-60 pp.7-12 |
SR, RCS, USN, AN (Joint) |
2008-10-23 09:50 |
Okinawa |
Okinawa industry support center |
[Invited Talk]
Cognitive Wireless Networks and Autonomous Optimization Algorithms Mikio Hasegawa (Tokyo Univ. of Science/NICT) RCS2008-114 SR2008-51 AN2008-39 USN2008-51 |
Various combinatorial optimization algorithms have been proposed and applied to various problems in many fields. As one ... [more] |
RCS2008-114 SR2008-51 AN2008-39 USN2008-51 pp.69-74(RCS), pp.91-96(SR), pp.59-64(AN), pp.77-82(USN) |
NC, NLP |
2008-06-27 16:00 |
Okinawa |
University of the Ryukyus |
A visualized analysis on state transition in Hopfield network
-- Search process of combinatorial optimization problems -- Kiyotaka Yamashita, Hiroshi Wakuya (Saga Univ.) NC2008-28 |
A Hopfield network is a good tool for solving combinatorial optimization problems, even though it sometimes fails to fin... [more] |
NC2008-28 pp.85-90 |
NLP |
2008-03-28 13:30 |
Hyogo |
|
A New Chaotic Algorithm for Solving Traveling Salesman Problems by Using 2-opt and Or-opt Algorithms Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2007-173 |
To nd the near optimum solutions of TSPs, a method introducing chaotic neurodynamics for solving TSPs has already been ... [more] |
NLP2007-173 pp.37-42 |