Sciweavers

2040 search results - page 291 / 408
» Approximate Expectation Maximization
Sort
View
EUROPAR
2009
Springer
15 years 11 months ago
Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures
One has a large workload that is “divisible” (its constituent work’s granularity can be adjusted arbitrarily) and one has access to p remote computers that can assist in comp...
Anne Benoit, Yves Robert, Arnold L. Rosenberg, Fr&...
SIGMETRICS
1998
ACM
15 years 10 months ago
Scheduling Policies to Support Distributed 3D Multimedia Applications
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
Thu D. Nguyen, John Zahorjan
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
15 years 10 months ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
COLT
2008
Springer
15 years 8 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
IJCAI
2007
15 years 7 months ago
Spiteful Bidding in Sealed-Bid Auctions
We study the bidding behavior of spiteful agents who, contrary to the common assumption of selfinterest, maximize a convex combination of their own profit and their competitors...
Felix Brandt, Tuomas Sandholm, Yoav Shoham