Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NLP, CAS |
2015-10-05 09:40 |
Hiroshima |
Aster Plaza |
Design of dynamic reinforcement functions based on action history in profit sharing reinforcement learning Takeshi Tagaya, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) CAS2015-20 NLP2015-81 |
[more] |
CAS2015-20 NLP2015-81 pp.1-5 |
NLP |
2015-07-21 13:30 |
Hokkaido |
Bibai Onsen Yu-rinkan |
Real-time recognition for vehicle environments using neural networks Hiromu Endo, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2015-67 |
This paper designs neural networks which realize real-time recognition
for vehicle environments such as traffic sign, t... [more] |
NLP2015-67 pp.1-5 |
NLP, CCS |
2015-06-11 09:25 |
Tokyo |
Waseda Univerisity |
An Adaptive Learning Method Based on Distance to Nodes in Self-Organizing Incremental Neural Networks Natsumi Oba, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2015-40 CCS2015-2 |
The self-organizing incremental neural networks realize the clustering of input
data by repeating to add and delete nod... [more] |
NLP2015-40 CCS2015-2 pp.7-12 |
NLP, CCS |
2015-06-11 15:05 |
Tokyo |
Waseda Univerisity |
A Hierarchical Routing Scheme Based on Address Information in MANET Yuki Hoshino, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2015-50 CCS2015-12 |
In this paper, a hierarchical routing method based on address information in MANETs is proposed. This method does not re... [more] |
NLP2015-50 CCS2015-12 pp.67-71 |
NLP |
2015-05-19 10:00 |
Aomori |
Yu-sa Asamushi |
An Automatic Adjustment Method for Parameters in Deep Learning Kazuki Urushiyama, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2015-34 |
In this paper, we propose the method which tunes learning rate dynamically and breaks off learning automatically. In gen... [more] |
NLP2015-34 pp.39-43 |
NLP |
2015-05-19 11:50 |
Aomori |
Yu-sa Asamushi |
Basic Performances of Deterministic PSO Networks Tomoyuki Sasaki, Hidehiro Nakano, Arata Miyauchi, Akira Taguchi (Tokyo City Univ.) NLP2015-38 |
PSO network is the method of dividing population of PSO into multiple sub-swarm groups, and each sub-swarm group is conn... [more] |
NLP2015-38 pp.61-66 |
NLP |
2015-04-24 16:15 |
Kagawa |
Kagawa Social Welfare Center |
Design of a processing unit for particle swarm optimizers Hidehiro Nakano, Yasuhiro Shimada, Arata Miyauchi (Tokyo City Univ.) NLP2015-26 |
In this paper, a processor which realizes the parallel calculations of Particle Swarm Optimizer (PSO) is proposed. As th... [more] |
NLP2015-26 pp.127-131 |
RECONF, CPSY, VLD, IPSJ-SLDM [detail] |
2015-01-30 13:40 |
Kanagawa |
Hiyoshi Campus, Keio University |
Relaxing constraint conditions in parallelizing compiler based on a polyhedral model Toma Ogata, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) VLD2014-142 CPSY2014-151 RECONF2014-75 |
Recently, it is general that computer has more than one processor inside and it is important to parallelize program to ... [more] |
VLD2014-142 CPSY2014-151 RECONF2014-75 pp.187-192 |
RECONF, CPSY, VLD, IPSJ-SLDM [detail] |
2015-01-30 17:10 |
Kanagawa |
Hiyoshi Campus, Keio University |
Real-time contour extraction for moving objects directly operating MPEG encoded data Syosuke Maruyama, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) VLD2014-151 CPSY2014-160 RECONF2014-84 |
Recently, the use of multimedia resources has spread, extensively.
Especially, MPEG video has been used in the various... [more] |
VLD2014-151 CPSY2014-160 RECONF2014-84 pp.239-244 |
NLP |
2015-01-26 10:00 |
Oita |
Compal Hall |
Finding plural solutions in high dimensional optimization problems using PSO with temporal couplings Kensuke Kimura, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-113 |
In the Particle Swarm Optimizer (PSO), the search performances can significantly decrease for high--dimensional optimiza... [more] |
NLP2014-113 pp.1-5 |
NLP |
2015-01-26 10:25 |
Oita |
Compal Hall |
A flooding sheme considering battery level in wireless sensor networks using chaotic neural networks Ryohei Sato, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-114 |
In this paper, efficient ooding schemes in wireless sensor networks are considered.
Based on our previous scheme using... [more] |
NLP2014-114 pp.7-12 |
NLP |
2014-12-03 15:50 |
Tokyo |
Kyoto Univ. Tokyo Office |
On random numbers used in discritization of position information in discrete PSOs Yoshihiko Hayakawa, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-105 |
Discrete PSO is an algorithm to solve discrete optimization problems.
The discrete PSO obtains solutions for the probl... [more] |
NLP2014-105 pp.35-40 |
NLP |
2014-12-04 11:20 |
Tokyo |
Kyoto Univ. Tokyo Office |
An artificial bee colony optimization algorithm for solving maximum power point tracking problems Masataka Kojima, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-110 |
In the photovoltaic power generation systems,
it is required that an operating point to maximize the output power valu... [more] |
NLP2014-110 pp.63-68 |
CPSY |
2014-11-13 15:30 |
Hiroshima |
Hiroshima University |
A Management Scheme for Pipeline Stage Unification Based on Frequency of Use for Functional Units Yuki Tanaka, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) CPSY2014-60 |
This paper shows a management scheme for Pipeline Stage Unification (PSU) which reduces energy consumption by dynamicall... [more] |
CPSY2014-60 pp.37-42 |
NLP |
2014-11-06 13:30 |
Niigata |
TsubameSanjo Regional Industries Promotion Center |
Analysis of characteristics for a scale parameter in artificial bee colony algorithms Takanari Yamaguchi, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-81 |
In the artificial bee colony algorithm, plural search points are selected and optimum solutions are found by repeating t... [more] |
NLP2014-81 pp.1-6 |
NLP, CAS |
2014-10-16 14:55 |
Ehime |
Ehime University |
A path finding method by a true slime mold model considering load balancing Takayoshi Sekiguchi, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) CAS2014-63 NLP2014-57 |
In this paper, the autonomous and distributed route search method based on true slime mold model is improved. In the rou... [more] |
CAS2014-63 NLP2014-57 pp.63-68 |
NLP |
2014-07-21 15:20 |
Hokkaido |
Hakodate City Central Library |
An artificial bee colony algorithm introducing relative evaluation and multi-dimensional update Shin Suzuki, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-36 |
An artificial Bee Colony (ABC) algorithm is an effective method for solving high-dimensional optimization problems. Howe... [more] |
NLP2014-36 pp.27-32 |
NLP |
2014-07-01 11:00 |
Miyagi |
Tohoku Univ. |
Solving dynamic optimization problems using an artificial bee colony with a memory scheme Masataka Kojima, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-29 |
Dynamic Optimization Problems (DOPs) are the problems of optimizing the function values of the time varying objective fu... [more] |
NLP2014-29 pp.47-52 |
NLP |
2014-05-27 11:20 |
Shimane |
Big Heart IZUMO |
Solving Performances of PSO Networks with Stochastic Couplings Tomoyuki Sasaki, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-11 |
In this paper, a stochastic coupling network topology is introduced in a particle swarm optimizer network. In the propos... [more] |
NLP2014-11 pp.51-56 |
NC, MBE (Joint) |
2014-03-18 15:20 |
Tokyo |
Tamagawa University |
A learning method for dynamic binary neural networks using a particle swarm optimizer Romu Nagano, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NC2013-113 |
This paper proposes a new learning algorithm to the dynamic binary neural network (DBNN). The proposed method aims to im... [more] |
NC2013-113 pp.145-149 |