2084 search results - page 380 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
73
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
SODA
1993
ACM
14 years 11 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
179
click to vote
CCS
2011
ACM
13 years 9 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...