Keyphrases
Guided Local Search
100%
Rapport
50%
VLSI Design
50%
Three-dimensional Bin Packing Problem
50%
Three-dimensional (3D)
41%
Computational Experiment
35%
Local Search
31%
Placement Problem
27%
Minimum number
20%
Constant Depth
20%
Greedy Heuristic
20%
Two Dimensional
20%
Time Limits
20%
Two-dimensional Bin Packing
20%
Sub-neighborhood
14%
Detailed Placement
14%
Local Search Heuristic
14%
Local Minima
14%
Large-sized
14%
Heuristic Algorithms
12%
Cellular Layout
8%
Design Process
8%
Route Analysis
8%
Routability
8%
Feedback Approach
8%
Timing Analysis
8%
Small Media
8%
Time Constraints
8%
VLSI Circuits
6%
Existing Algorithms
6%
Signaling Pathway
6%
Bounding Box
6%
Area Usage
6%
Wiring
6%
Layout Problem
6%
Geometric Location
6%
Fast Local Search
6%
Cell Placement
6%
Time Complexity
6%
Physical Layout
6%
Computer Science
Computational Experiment
54%
Objective Function
50%
Bin Packing Problem
50%
Metaheuristics
37%
Detailed Placement
37%
Local Minimum
37%
Time Complexity
25%
Physical Layout
25%
Greedy Heuristic
16%
Timing Analysis
12%
Timing Constraint
12%
Heuristic-Based Algorithm
8%
Engineering
Local Search
50%
Objective Function
12%
Local Minimum
8%
