Sciweavers

3791 search results - page 20 / 759
» Packing sets of patterns
Sort
View
EOR
2006
93views more  EOR 2006»
13 years 7 months ago
A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Given a set of rectangular pieces and a container of fixed width and variable length, the two-dimensional strip packing problem (2D-SPP) consists of orthogonally placing all the p...
Andreas Bortfeldt
EOR
2007
78views more  EOR 2007»
13 years 7 months ago
A heuristic for the three-dimensional strip packing problem
The contribution presents a heuristic for the three-dimensional strip packing problem (3D-SPP) with rectangular pieces (boxes). The considered 3D-SPP can be formulated as follows:...
Andreas Bortfeldt, Daniel Mack
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 6 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
FPL
1997
Springer
125views Hardware» more  FPL 1997»
13 years 11 months ago
VPR: A new packing, placement and routing tool for FPGA research
We describe the capabilities of and algorithms used in a new FPGA CAD tool, Versatile Place and Route (VPR). In terms of minimizing routing area, VPR outperforms all published FPG...
Vaughn Betz, Jonathan Rose
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
14 years 1 months ago
Reducing the Frequent Pattern Set
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent pap...
Ronnie Bathoorn, Arne Koopman, Arno Siebes