2714 search results - page 5 / 543 » Approximation Schemes for Scheduling |
ICTCS
2001
Springer
14 years 3 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
ECRTS
2009
IEEE
13 years 8 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
JMLR
2010
13 years 5 months ago
2010
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
IPPS
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
INFOCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...