3049 search results - page 138 / 610 » On the Convergence of Bound Optimization Algorithms |
128
click to vote
UAI
2004
15 years 6 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
178
click to vote
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
127
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— A fundamental paradigm in peer-to-peer (P2P) content distribution is that of a large community of intermittentlyconnected nodes that cooperate to share files. Because ...
147
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
128
click to vote
SSS
2009
Springer
15 years 9 months ago
2009
Springer
Consider a fully connected network where up to t processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of e...