791 search results - page 48 / 159 » Approximating the Maximum Sharing Problem |
ISAAC
2000
Springer
13 years 11 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
ECSCW
1997
13 years 9 months ago
1997
: If the sharing of context is now widely acknowledged as a condition for successful communication, existing studies do not allow to determine whether it is necessary to restore th...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— The coexistence and resource sharing between a primary network utilizing cognitive relays and a secondary network are investigated. Two multiple access protocols are pr...
EUROPAR
2010
Springer
13 years 7 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...