Sciweavers

9 search results - page 1 / 2
» Simulated Annealing Based Algorithm for the 2D Bin Packing P...
Sort
View
OR
2005
Springer
13 years 10 months ago
Simulated Annealing Based Algorithm for the 2D Bin Packing Problem with Impurities
B. Beisiegel, Josef Kallrath, Y. Kochetov, A. Rudn...
EOR
2007
97views more  EOR 2007»
13 years 5 months ago
Using pattern matching for tiling and packing problems
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 5 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
AI
1998
Springer
13 years 5 months ago
GAS, A Concept on Modeling Species in Genetic Algorithms
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
Márk Jelasity, József Dombi
ASPDAC
2006
ACM
146views Hardware» more  ASPDAC 2006»
13 years 11 months ago
A fixed-die floorplanning algorithm using an analytical approach
— Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the t...
Yong Zhan, Yan Feng, Sachin S. Sapatnekar