Sciweavers

2714 search results - page 100 / 543
» Approximation Schemes for Scheduling
Sort
View
HPCA
2011
IEEE
14 years 4 months ago
Bloom Filter Guided Transaction Scheduling
Contention management is an important design component to a transactional memory system. Without effective contention management to ensure forward progress, a transactional memory...
Geoffrey Blake, Ronald G. Dreslinski, Trevor N. Mu...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 6 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
16 years 28 days ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
94
Voted
QOFIS
2001
Springer
15 years 5 months ago
DSS: A Deterministic and Scalable QoS Provisioning Scheme
Abstract. The design of traffic management schemes for multimedia applications is a challenge for the future Internet. The main problem is the high burstiness of the multimedia tr...
Guillaume Urvoy-Keller, Ernst Biersack
100
Voted
ICUMT
2009
14 years 10 months ago
A new approach to the design of wireless data broadcasting systems: An analysis-based cost-effective scheme
Abstract--A new approach to the design of wireless data broadcasting systems is introduced. The proposed approach is based on the mathematical analysis of the aforementioned system...
Christos Liaskos, Sophia G. Petridou, Georgios I. ...