Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
DE, IPSJ-DBS, IPSJ-IFAT [detail] |
2023-09-22 11:20 |
Fukuoka |
Kitakyushu International Conference Center |
A prototype system for interactively combining more than 1000 pieces of table formatted big data and interactively overviewing of it
-- Performance measurement of overviewing (displaying, searching, tabulating, and sorting) more than 3 trillion records of virtual table formatted data -- Shinji Furusho (NNI Technologies), Atsushi Iizawa (Ricoh IT Solutions), Hiroshi Tezuka (Bird's-eye View Engineering Institute), Yukio Yamamoto (ISAS), Takashi Matsuhisa, Manabu Iida (SEC), Tadashi Nagao (Layman's Admin) DE2023-24 |
The virtual tabular data, created with the purpose of facilitating the distribution of diverse tabular big data, is a vi... [more] |
DE2023-24 pp.78-83 |
CCS, NLP |
2020-06-05 13:00 |
Online |
Online |
Dynamically changing penalties method for Large-Scale multiple-Vehicle Bike Sharing System Routing Problem Honami Tsushima (TUS), Takafumi Matsuura (NIT), Tohru Ikeguchi (TUS) NLP2020-14 CCS2020-4 |
In a bike sharing system (BSS) , we proposed a multiple-Vehicle Bike Sharing System Routing Problem (mBSSRP) to determin... [more] |
NLP2020-14 CCS2020-4 pp.19-22 |
NLC, IPSJ-ICS |
2019-06-21 13:10 |
Hiroshima |
Hiroshima University of Economics (Tatemachi Campus) |
Flowchart creation from call center pseudo-interactive data using tabulation technology Masaki Murata, Yutaro Mori (Tottori Univ.), Kazuhito Koyama (DATT JAPAN Inc.) NLC2019-1 |
In this research, we proposed a method of creating a flowchart that is useful for application to chat bots by using info... [more] |
NLC2019-1 pp.1-6 |
NLP |
2019-05-11 10:25 |
Oita |
J:COM HoltoHALL OITA |
Study of A Solving Method for a Multiple Vehicle Bike Sharing System Routing Problem with Soft Constraints Honami Tsushima, Takayuki Kimura, Takafumi Matsuura (NIT) NLP2019-12 |
To restore the number of bicycle in each port of the bike sharing system, we have formulated a multi- ple-Vehicle Bike S... [more] |
NLP2019-12 pp.65-70 |
NLP, NC (Joint) |
2019-01-23 14:10 |
Hokkaido |
The Centennial Hall, Hokkaido Univ. |
Chaos Search Method for Multiple-Vehicle Bike Sharing System Routing Problem Honami Tsushima, Takafumi Matsuura, Takayuki Kimura (NIT) NLP2018-106 |
A multiple-Vehicle Bike Sharing System Routing Problem (mBSSRP) is proposed as a combinatorial optimization problem to r... [more] |
NLP2018-106 pp.57-62 |
NLP |
2017-11-05 14:25 |
Miyagi |
Research Institute of Electrical Communication Tohoku University |
Solving latency location routing problem using exponential tabu search Masaya Kaneko, Yuuki Morita, Hiroki Sawade, Takayuki Kimura (NIT) NLP2017-68 |
In this report, we propose a new solving method using an exponential tabu search
for a latency location routing prob... [more] |
NLP2017-68 pp.19-24 |
NLP |
2014-07-21 14:30 |
Hokkaido |
Hakodate City Central Library |
Digital Circuit Implementation of a Cost Calculation for Partial-update Exponential Chaotic Tabu Search Hardware Systems Takeshi Miura, Masato Ozawa, Takemori Orima, Yoshihiko Horio (Tokyo Denki Univ.) NLP2014-34 |
The exponential chaotic tabu search is an efficient meta-heuristic algorithm for combinatorial optimization problems. Ba... [more] |
NLP2014-34 pp.17-22 |
NLP |
2014-07-21 14:55 |
Hokkaido |
Hakodate City Central Library |
Solving Ability of Lin-Kernighan Method Driven by Chaotic Dynamics for Traveling Salesman Problems Takahiro Mitsuoka, Mikio Hasegawa (Tokyo Univ. of Science) NLP2014-35 |
Effectiveness of chaos for optimization has been shown by many previous researches. In this paper, a chaotic search base... [more] |
NLP2014-35 pp.23-26 |
NLP |
2014-01-21 16:00 |
Hokkaido |
Niseko Park Hotel |
Analog/Digital Hybrid Hardware System Architecture for Parallel Updating Exponential Chaotic Tabu Search Masato Ozawa, Akihito Toyoda, Yoshihiko Horio (Tokyo Denki Univ.), Kazuyuki Aihara (Univ. of Tokyo) NLP2013-143 |
The analog/digital hybrid hardware system for the synchronous updating exponential chaotic tabu search has been proposed... [more] |
NLP2013-143 pp.77-81 |
NLP |
2013-12-07 10:25 |
Overseas |
City University of Hong Kong |
A Switched-Current Chaotic Neuron IC Prototype for Synchronous Exponential Chaotic Tabu Search Syu Tanaka, Akihito Toyoda, Yoshihiko Horio (Tokyo Denki University), Kazuyuki Aihara (Univ. of Tokyo) NLP2013-125 |
We design a switched-current (SI) chaotic neuron integrated circuit, which is suitable for a large-size analog/digital h... [more] |
NLP2013-125 pp.65-69 |
NLP |
2013-03-15 11:05 |
Chiba |
Nishi-Chiba campus, Chiba Univ. |
Effects of Saturated Neuronal Internal States in Synchronous Exponential Chaotic Tabu Search for Quadratic Assignment Problems Masato Ozawa, Akihito Toyoda, Yoshihiko Horio (Tokyo Denki Univ.), Kazuyuki Aihara (Univ. of Tokyo) NLP2012-165 |
In order to solve the quadratic assignment problem with a parallel hardware system, an exponential chaotic tabu search, ... [more] |
NLP2012-165 pp.109-114 |
HCGSYMPO (2nd) |
2012-12-10 - 2012-12-12 |
Kumamoto |
Kumamoto-Shintoshin-plaza |
An Improvement of Creation for User's Fragrance with Interactive Tabu Search
-- Investigation for the Efficient Search of Blending Aroma Sources -- Makoto Fukumoto, Keiji Kawai (Fukuoka Inst. Tech.), Makoto Inoue (Akita National College of Tech.), Jun-ichi Imai (Chiba Inst. Tech.) |
Creation of media contents is one of the important targets in the area of engineering. We have already proposed a method... [more] |
|
MBE |
2011-07-09 10:00 |
Tokushima |
The University of Tokushima |
An Automatic Scheduling Method of Clinical Exercises Hisashi Miyazaki, Isao Kayano, Osamu Hiramatsu (Kawasaki Univ), Sousuke Amasaki (Okayama Prefectural Univ) MBE2011-31 |
In this paper, we propose an automatic scheduling method of clinical exercises using tabu search that is one of the meta... [more] |
MBE2011-31 pp.59-63 |
NLP |
2011-03-10 09:00 |
Tokyo |
Tokyo University of Science |
Solving TSP by a tabu search with time-variant tabu tenure Takuya Kurihara, Kenya Jin'no (Nippon Inst. of Tech.) NLP2010-163 |
The most of scheduling problems and vehicle routing problems are formulated as combinatorial optimization problems.
The... [more] |
NLP2010-163 pp.1-6 |
CS, SIP, CAS |
2011-03-04 14:10 |
Okinawa |
Ohhamanobumoto memorial hall (Ishigaki)( |
[Poster Presentation]
A Study on Initial Solution for Designing CSD Coefficient FIR Filters using Branch and Bound Method Nobuo Takahashi, Kenji Suyama (Tokyo Denki Univ.) CAS2010-165 SIP2010-181 CS2010-135 |
In this paper, we study a selecting way of an initial solution for a fast design of FIR filters with CSD coefficients. T... [more] |
CAS2010-165 SIP2010-181 CS2010-135 pp.369-374 |
NLP |
2010-03-09 11:10 |
Tokyo |
|
Soft Tabu Search for Solving Traveling Salesman Problem Takafumi Matsuura, Tohru Ikeguchi (Saitama Univ.) NLP2009-163 |
To avoid local minima of combinatorial optimization problems, the tabu search have been proposed. Although the tabu sear... [more] |
NLP2009-163 pp.31-36 |
NLP |
2009-11-11 15:10 |
Kagoshima |
|
Evaluation of Neuron Selection Techniques for Synchronous Exponential Chaotic Tabu Search for Quadratic Assignment Problems Tetsuo Kawamura, Yoshihiko Horio (Tokyo Denki Univ.) NLP2009-94 |
The tabu search was implemented on a neural network with chaotic neuro-dynamics. This chaotic tabu search shows great pe... [more] |
NLP2009-94 pp.67-71 |
NLP |
2009-05-15 17:35 |
Shiga |
Ritsumeikan University |
Solving Asymmetric TSP by Combination of Chaotic Neurodynamics and Block Shift operations Toshihiro Tachibana, Masaharu Adachi (Tokyo Denki Univ.) NLP2009-13 |
In this paper, a method for solving Asymmetric Traveling Salesman Problems is proposed. Where the asymmetric TSP means t... [more] |
NLP2009-13 pp.63-66 |
NLP |
2008-03-28 14:20 |
Hyogo |
|
A Modified Synchronous Exponential Chaotic Tabu Search for Quadratic Assignment Problems Naoto Yokota, Yoshihiko Horio (Tokyo Denki Univ.), Kazuyuki Aihara (Univ of Tokyo), Mikio Hasegawa (Tokyo Univ of Science) NLP2007-175 |
A tabu search was implemented on a chaotic neural network showing great performance in solving a
quadratic assignment p... [more] |
NLP2007-175 pp.49-54 |
RECONF, CPSY, VLD, IPSJ-SLDM |
2008-01-16 16:35 |
Kanagawa |
Hiyoshi Campus, Keio University |
Solving the Quadratic Assignment Problem by Hardware Based on a Systolic Algorithm Yoshihiro Kimura, Shin'ichi Wakabayashi, Shinobu Nagayama (Hiroshima City Univ.) VLD2007-114 CPSY2007-57 RECONF2007-60 |
For the quadratic assignment problem (QAP), a heuristic algorithm based on tabu search, which is implemented as hardware... [more] |
VLD2007-114 CPSY2007-57 RECONF2007-60 pp.55-60 |