5608 search results - page 228 / 1122 » On the Theory of Matchgate Computations |
180
click to vote
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
188
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...
161
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...
157
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...
169
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...