Sciweavers

Share
PPL
2007
71views more  PPL 2007»
8 years 2 months ago
Scheduling Algorithms for Data Redistribution and Load-Balancing on Master-Slave Platforms
In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of...
Loris Marchal, Veronika Rehn, Yves Robert, Fr&eacu...
JCT
2007
117views more  JCT 2007»
8 years 3 months ago
Large independent sets in regular graphs of large girth
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
Joseph Lauer, Nicholas C. Wormald
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
8 years 4 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
ICALP
2010
Springer
8 years 5 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
9 years 4 months ago
Profile-Driven Cache Management
Modern distributed information systems cope with disconnection and limited bandwidth by using caches. In communicationconstrained situations, traditional demand-driven approaches ...
Mitch Cherniack, Eduardo F. Galvez, Michael J. Fra...
books