1434 search results - page 184 / 287 » Distributed Computing with Imperfect Randomness |
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we consider, compare and analyze three game theoretical Grid resource allocation mechanisms. Namely, 1) the non-cooperative sealed-bid method where tasks are auction...
SPAA
1990
ACM
15 years 6 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
138
click to vote
HPDC
2008
IEEE
15 years 2 months ago
2008
IEEE
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
229
Voted
CCS
2011
ACM
14 years 2 months ago
2011
ACM
Paper forgery is among the leading causes of corruption in many developing regions [2]. In this paper, we introduce PaperSpeckle, a robust system that leverages the natural random...
112
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...