1074 search results - page 42 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
101
click to vote
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
IPSN
2004
Springer
15 years 3 months ago
2004
Springer
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
74
Voted
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
Dynamic data streams are those whose underlying distribution changes over time. They occur in a number of application domains, and mining them is important for these applications....