1220 search results - page 61 / 244 » Minimal Interval Completions |
WAOA
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
JCO
2010
13 years 4 months ago
2010
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
ICNC
2005
Springer
14 years 2 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
BROADNETS
2004
IEEE
14 years 1 months ago
2004
IEEE
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...