Sciweavers

182 search results - page 27 / 37
» Approximation algorithms for time-constrained scheduling on ...
Sort
View
CORR
2012
Springer
210views Education» more  CORR 2012»
12 years 3 months ago
Stability of the Max-Weight Protocol in Adversarial Wireless Networks
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
Sungsu Lim, Kyomin Jung, Matthew Andrews
COCOA
2009
Springer
13 years 11 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
WICON
2008
13 years 9 months ago
A fluid-flow model for backlog-based CSMA policies
We present a fluid flow model to analyze backlog-based CSMA policies. The model is obtained using a CSMA fixed point approximation that has been recently proposed and analyzed. We...
Atilla Eryilmaz, Peter Marbach, Asuman E. Ozdaglar
COMPGEOM
2006
ACM
14 years 1 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...