44 search results - page 8 / 9 » Maximizing the Number of Packed Rectangles |
CAAN
2004
Springer
15 years 7 months ago
2004
Springer
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
114
click to vote
VIS
2007
IEEE
16 years 3 months ago
2007
IEEE
We describe a novel volumetric global illumination framework based on the Face-Centered Cubic (FCC) lattice. An FCC lattice has important advantages over a Cartesian lattice. It ha...
129
click to vote
ICC
2009
IEEE
14 years 11 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
114
click to vote
TAMC
2007
Springer
15 years 8 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
115
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...