360 search results - page 34 / 72 » The TV-Break Packing Problem |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...
86
Voted
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
SMA
2005
ACM
15 years 3 months ago
2005
ACM
In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk...
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
JCO
2007
14 years 9 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...