1612 search results - page 112 / 323 » Analysing Randomized Distributed Algorithms |
137
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
Overhearing is gaining attention as a generic method for cooperative monitoring of distributed, open, multiagent systems. It involves monitoring the routine conversations of agent...
138
Voted
NETGAMES
2006
ACM
15 years 10 months ago
2006
ACM
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...
149
click to vote
EMO
2001
Springer
15 years 9 months ago
2001
Springer
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
143
click to vote
SIGCOMM
2010
ACM
15 years 5 months ago
2010
ACM
We introduce and motivate crowd computing, which combines mobile devices and social interactions to achieve large-scale distributed computation. An opportunistic network of mobile...
156
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...