8699 search results - page 375 / 1740 » Elements of the Theory of Computation |
195
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
175
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
Computational models of motivation are tools that artificial agents can use to autonomously identify, prioritize, and select the goals they will pursue. Previous research has focu...
172
click to vote
AAAI
2006
15 years 8 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
161
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
218
click to vote
IACR
2011
14 years 6 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...