Presentation 2006-03-20
Two-Staged Tabu Search for Floorplan Problem Using O-Tree Structure
Kimihiko NUMAYAMA, Hiroshi NINOMIYA, Hideki ASAI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This papar describes the two-staged Tabu search for the non-slicing floorplan problem using the orderd tree representation called O-Tree. The floorplan problem is a part of VLSI layout design problem that places the rectangle blocks called modules so that each module does not overlap mutually. It is the purpose of a floorplan to scale down the area and the wirelength. Finally, we demonstrate the validity of Two-staged Tabu search for MCNC benchmark tests through the computer simulations.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Floorplan plobrem / O-Tree / Tabu Search / Two-Staged Tabu Search
Paper # NLP2005-146
Date of Issue

Conference Information
Committee NLP
Conference Date 2006/3/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Two-Staged Tabu Search for Floorplan Problem Using O-Tree Structure
Sub Title (in English)
Keyword(1) Floorplan plobrem
Keyword(2) O-Tree
Keyword(3) Tabu Search
Keyword(4) Two-Staged Tabu Search
1st Author's Name Kimihiko NUMAYAMA
1st Author's Affiliation Department of System Enginnering, Shizuoka University()
2nd Author's Name Hiroshi NINOMIYA
2nd Author's Affiliation Department of Information Science, Shonan Institute of Technology
3rd Author's Name Hideki ASAI
3rd Author's Affiliation Department of System Enginnering, Shizuoka University
Date 2006-03-20
Paper # NLP2005-146
Volume (vol) vol.105
Number (no) 675
Page pp.pp.-
#Pages 6
Date of Issue