Sciweavers

160 search results - page 11 / 32
» A General Buffer Scheme for the Windows Scheduling Problem
Sort
View
CLUSTER
2000
IEEE
15 years 4 months ago
Contention-free Complete Exchange Algorithm on Clusters
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...
Anthony T. C. Tam, Cho-Li Wang
JSAC
2010
142views more  JSAC 2010»
14 years 10 months ago
Cross-layer optimization for streaming scalable video over fading wireless networks
—We present a cross-layer design of transmitting scalable video streams from a base station to multiple clients over a shared fading wireless network by jointly considering the a...
Honghai Zhang, Yanyan Zheng, Mohammad A. Khojastep...
FSTTCS
2010
Springer
14 years 9 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
EOR
2008
110views more  EOR 2008»
14 years 12 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 4 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...