| 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 # | |
| MSS | 2007-06-28 13:00 |
Okinawa | Cooperation and Its Effect in Parallel Tabu Search Hidekazu Naka, Masashi Murayama, Morikazu Nakamura (Univ. of the Ryukyus)  CST2007-1 |
This paper presents a new cooperation method in parallel tabu search. In our parallel tabu search, multiple tabu proce... [more] |
CST2007-1 pp.1-6 |
|
| SIP, CAS, CS | 2007-03-06 09:30 |
Tottori | Blancart Misasa (Tottori) | [Poster Presentation]
Cost Optimization Using Tabu Search in Hardware Design of Arbitrary Functions Koji Kotani, Takao Sasaki, Hisamichi Toyoshima (Kanagawa Univ.) CAS2006-95 SIP2006-196 CS2006-112 |
In digital circuit design using a hardware description language, some elementary functions and user defined functions ca... [more] | CAS2006-95 SIP2006-196 CS2006-112 pp.15-18 |
| VLD, CPSY, RECONF, IPSJ-SLDM | 2007-01-17 16:00 |
Tokyo | Keio Univ. Hiyoshi Campus | A Parallel Algorithm Based on Genetic Algorithm and Tabu Search for LSI Floorplanning and Its Implementation on a PC Cluster Takayoshi Shimazu, Shin'ichi Wakabayashi, Shinobu Nagayama (Hiroshima City Univ.) |
This paper proposes a parallel floorplanning algorithm for VLSI floorplanning, which was based on genetic algorithm (GA)... [more] | VLD2006-90 CPSY2006-61 RECONF2006-61 pp.31-36 |
| VLD, CPSY, RECONF, IPSJ-SLDM | 2007-01-17 16:25 |
Tokyo | Keio Univ. Hiyoshi Campus | A Hardware Algorithm for the Quadratic Assignment Problem Based on Tabu Search Using FPGAs Yoshihiro Kimura, Shin'ichi Wakabayashi, Shinobu Nagayama (Hiroshima City Univ.) |
In this paper, a hardware algorithm for the quadratic assignment problem (QAP) based on tabu search was proposed. The p... [more] | VLD2006-91 CPSY2006-62 RECONF2006-62 pp.37-42 |
| MSS | 2006-07-26 13:00 |
Kyoto | Kyoto Institute of Technology | Cooperation based on Searching History in Parallel Tabu Search Hidekazu Naka, Morikazu Nakamura (Univ. of the Ryukyus) |
Tabu Search (TS) is one of the most powerful methods in the technique of calculating approximate solutions of combinat... [more] |
CST2006-14 pp.25-30 |
| NLP | 2006-03-20 15:20 |
Tokyo | Hosei Univ.(Ichigaya Campus) | Two-Staged Tabu Search for Floorplan Problem Using O-Tree Structure Kimihiko Numayama (Shizuoka Univ), Hiroshi Ninomiya (SIT), Hideki Asai (Shizuoka Univ) |
This papar describes the two-staged Tabu search for the non-slicing floorplan problem using the orderd tree representat... [more] | NLP2005-146 pp.53-58 |
| PN, IN (Joint) |
2005-10-13 14:00 |
Kanagawa | Keio Univ. (Yagami) | A Tabu Search Method of Logical Topology Design in IP over WDM Networks Galy Lee (Waseda Univ.), Sugang Xu (NICT), Yoshiaki Tanaka (Waseda Univ.) |
Given a static traffic condition, the motivation of logical topology design in IP over WDM networks is to optimize the n... [more] | IN2005-88 pp.1-6 |
| MSS | 2005-06-30 15:20 |
Okinawa | Jichi Kaikan(Naha) | A parallel tabu search based on relinking of searched space Hidekazu Naka, Morikazu Nakamura (Univ. of the Ryukyus) |
Tabu search(TS) is one of the most powerful methods in the technique of calculating the approximate solution of combinat... [more] | CST2005-5 pp.23-28 |
| COMP | 2005-06-24 10:30 |
Toyama | Objective Function Adjustment Algorithm for Combinatorial Optimization Problems Hiroki Tamura, Zheng Tang, Masahiro Ishii (Toyama Univ.) |
In this paper, we proposed an improved algorithm of Guided Local Search (GLS) for Combinatorial Optimization problems, w... [more] | COMP2005-18 pp.1-4 |
|
[Return to Top Page]