Sciweavers

1279 search results - page 163 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
FSTTCS
2010
Springer
13 years 7 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, ...
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 20 days ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
ATAL
2008
Springer
13 years 11 months ago
Dynamics based control with PSRs
We present an extension of the Dynamics Based Control (DBC) paradigm to environment models based on Predictive State Representations (PSRs). We show an approximate greedy version ...
Ariel Adam, Zinovi Rabinovich, Jeffrey S. Rosensch...
INFOCOM
2009
IEEE
14 years 3 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
IPCO
2007
98views Optimization» more  IPCO 2007»
13 years 10 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...