Sciweavers

94 search results - page 14 / 19
» Improved Bounds on Relaxations of a Parallel Machine Schedul...
Sort
View
156
Voted
HPDC
2010
IEEE
15 years 4 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
147
Voted
ICPP
2006
IEEE
15 years 9 months ago
Achieving Bounded Delay on Message Delivery in Publish/Subscribe Systems
Publish/subscribe (pub/sub) systems are very suitable for the dissemination of dynamic information over the Internet. As dynamic information is usually characterized by a short li...
Jinling Wang, Jiannong Cao, Jing Li, Jie Wu
126
Voted
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 1 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
112
Voted
SPAA
1993
ACM
15 years 7 months ago
Optimal Broadcast and Summation in the LogP Model
We consider several natural broadcasting problems for the LogP model of distributed memory machines recently proposed by Culler et al. For each of these problems, we present algor...
Richard M. Karp, Abhijit Sahay, Eunice E. Santos, ...
144
Voted
SPAA
2005
ACM
15 years 9 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...