2084 search results - page 53 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
106
click to vote
LATIN
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
IEEEPACT
1997
IEEE
15 years 1 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— We propose an inverse agreement control strategy for multiple nonholonomic agents that forces the team members to disperse in the workspace in a distributed manner. Both the ca...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...