92 search results - page 3 / 19 » Separation Results Via Leader Election Problems |
DC
2010
14 years 9 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
64
Voted
FOSSACS
2004
Springer
15 years 2 months ago
2004
Springer
This paper compares the expressiveness of ambient calculi against different dialects of the pi-calculus. Cardelli and Gordon encoded the asynchronous pi-calculus into their calcul...
AAAI
2010
14 years 7 months ago
2010
We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each candidate c by one or more clones, i.e., new candidates that...
IWINAC
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...