5153 search results - page 367 / 1031 » Introduction to Randomized Algorithms |
153
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
142
Voted
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
127
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
177
Voted
SPAA
1994
ACM
15 years 8 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
152
Voted
AAAI
2008
15 years 7 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...