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...
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...
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 "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...
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...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...
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...