1074 search results - page 109 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
128
Voted
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
138
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
158
Voted
COLT
2010
Springer
15 years 1 months ago
2010
Springer
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
118
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
144
Voted
PODC
2012
ACM
13 years 5 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...