Sciweavers

2714 search results - page 85 / 543
» Approximation Schemes for Scheduling
Sort
View
89
Voted
CN
2004
138views more  CN 2004»
15 years 12 days ago
Performance evaluation of prioritized scheduling with buffer management for differentiated services architectures
Differentiated services (DiffServ) is an architecture for the Internet in which various applications are supported using a simple classification scheme. Packets entering the DiffS...
Ahmed E. Kamal, Hossam S. Hassanein
93
Voted
DAM
2006
78views more  DAM 2006»
15 years 18 days ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter
INFOCOM
1997
IEEE
15 years 4 months ago
A Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
Dallas E. Wrege, Jörg Liebeherr
SPAA
2010
ACM
15 years 23 days ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
CGF
2008
98views more  CGF 2008»
15 years 20 days ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett