Sciweavers

1125 search results - page 81 / 225
» On the job rotation problem
Sort
View
EOR
2007
97views more  EOR 2007»
13 years 11 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...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 7 days ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi
EOR
2007
88views more  EOR 2007»
13 years 11 months ago
The minimum size instance of a Pallet Loading Problem equivalence class
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
Gustavo H. A. Martins, Robert F. Dell
ICIP
2001
IEEE
15 years 22 days ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
14 years 4 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami