309 search results - page 50 / 62 » Approximation algorithms for dynamic resource allocation |
SIGMETRICS
1997
ACM
14 years 2 days ago
1997
ACM
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
In this paper we present an online method for managing a goaloriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedba...
ESWS
2005
Springer
14 years 1 months ago
2005
Springer
Recent advances in e-learning techonologies and web services make realistic the idea that courseware for personalized e-learning can be built by dynamic composition of distributed ...