Sciweavers

1292 search results - page 51 / 259
» Revisiting the optimal scheduling problem
Sort
View
ACTA
1998
111views more  ACTA 1998»
14 years 11 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
MMM
2007
Springer
127views Multimedia» more  MMM 2007»
15 years 6 months ago
Optimizing the Throughput of Data-Driven Based Streaming in Heterogeneous Overlay Network
Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in deployment over Internet. In such systems, nodes rando...
Meng Zhang, Chunxiao Chen, Yongqiang Xiong, Qian Z...
AUSSOIS
2001
Springer
15 years 4 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
TON
2010
127views more  TON 2010»
14 years 6 months ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi
ICALP
2007
Springer
15 years 6 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal