Sciweavers

206 search results - page 41 / 42
» Better Bounds for Online Scheduling
Sort
View
ISCC
2006
IEEE
188views Communications» more  ISCC 2006»
13 years 11 months ago
Active Learning Driven Data Acquisition for Sensor Networks
Online monitoring of a physical phenomenon over a geographical area is a popular application of sensor networks. Networks representative of this class of applications are typicall...
Anish Muttreja, Anand Raghunathan, Srivaths Ravi, ...
HPDC
2003
IEEE
13 years 11 months ago
SODA: A Service-On-Demand Architecture for Application Service Hosting Utility Platforms
The Grid is realizing the vision of providing computation as utility: computation jobs can be scheduled on-demand in Grid hosts based on available computation capacity. In this pa...
Xuxian Jiang, Dongyan Xu
ITCC
2003
IEEE
13 years 11 months ago
A New Quality of Service Metric for Hard/Soft Real-Time Applications
Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...
Shaoxiong Hua, Gang Qu
PODC
2009
ACM
14 years 6 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
FOCS
2009
IEEE
14 years 16 days ago
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna