2479 search results - page 412 / 496 » Quantum complexity theory |
128
click to vote
SIGCOMM
2004
ACM
15 years 8 months ago
2004
ACM
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
151
click to vote
SMA
2003
ACM
15 years 8 months ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
127
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
145
click to vote
STOC
2010
ACM
15 years 8 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...
139
Voted
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...