Sciweavers

5169 search results - page 201 / 1034
» Locality approximation using time
Sort
View
OSDI
2008
ACM
16 years 6 months ago
Probabilistic Inference in Queueing Networks
Although queueing models have long been used to model the performance of computer systems, they are out of favor with practitioners, because they have a reputation for requiring u...
Charles A. Sutton, Michael I. Jordan
IPPS
2007
IEEE
16 years 18 days ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
CLUSTER
2001
IEEE
15 years 10 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
RTCSA
2006
IEEE
16 years 9 days ago
Characterization and Analysis of Tasks with Offsets: Monotonic Transactions
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
Karim Traore, Emmanuel Grolleau, Francis Cottet
158
Voted
ICML
2003
IEEE
16 years 7 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford