Sciweavers

5580 search results - page 92 / 1116
» Randomized priority algorithms
Sort
View
ICPADS
2006
IEEE
15 years 3 months ago
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
Mohammad I. Daoud, Nawwaf N. Kharma
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
15 years 10 months ago
Sampling-based dimension reduction for subspace approximation
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
Amit Deshpande, Kasturi R. Varadarajan
INFOCOM
2005
IEEE
15 years 3 months ago
Non-uniform random membership management in peer-to-peer networks
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
Ming Zhong, Kai Shen, Joel I. Seiferas
STOC
2006
ACM
100views Algorithms» more  STOC 2006»
15 years 10 months ago
On the solution-space geometry of random constraint satisfaction problems
Dimitris Achlioptas, Federico Ricci-Tersenghi
STOC
2006
ACM
107views Algorithms» more  STOC 2006»
15 years 10 months ago
Truthful randomized mechanisms for combinatorial auctions
Shahar Dobzinski, Noam Nisan, Michael Schapira