1220 search results - page 215 / 244 » Minimal Interval Completions |
DAGSTUHL
2007
13 years 9 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
IJRR
2006
13 years 7 months ago
2006
This paper reports how and to what extent the mass distribution of a passive dynamic walker can be tuned to maximize walking speed and stability. An exploration of the complete pa...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is ...
IFIPTCS
2010
13 years 5 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...