438 search results - page 57 / 88 » A Theory of Competitive Analysis for Distributed Algorithms |
148
click to vote
WSNA
2003
ACM
15 years 8 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
119
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
159
click to vote
PODC
2012
ACM
13 years 5 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
157
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
119
click to vote
AAAI
2006
15 years 4 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...