517 search results - page 26 / 104 » Approximation Algorithms for Scheduling with Reservations |
DAM
2007
14 years 10 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
CPM
1999
Springer
15 years 2 months ago
1999
Springer
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
AUTOMATICA
2007
14 years 10 months ago
2007
The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous....
ESA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...