3791 search results - page 38 / 759 » Packing sets of patterns |
SDM
2009
SIAM
15 years 8 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
ICCAD
2007
IEEE
15 years 8 months ago
2007
IEEE
— In order to reduce parasitic mismatch in analog circuits, some groups of devices are required to share a common centroid while being placed. Devices are split into smaller ones...
ESA
2009
Springer
15 years 5 months ago
2009
Springer
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
SAC
2005
ACM
15 years 4 months ago
2005
ACM
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
100
click to vote
GECCO
2009
Springer
15 years 3 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...