1888 search results - page 123 / 378 » Proof theory and computational analysis |
108
Voted
STOC
2010
ACM
15 years 5 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...
106
Voted
AAAI
2006
15 years 2 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...
91
Voted
ATAL
2009
Springer
15 years 7 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...
84
Voted
IPL
2007
15 years 15 days ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
96
Voted
IJAC
2002
15 years 11 days ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...