478 search results - page 43 / 96 » A simple expected running time analysis for randomized |
HICSS
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, we define a continuum of modeling styles, ranging from collections of very simple agents on one end to collections of very complex agents at the other end, and a s...
JMLR
2011
13 years 3 months ago
2011
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
APLAS
2009
ACM
14 years 3 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
The estimation error performance of Gaussian belief propagation based distributed estimation in a large sensor network employing random sleep strategies is explicitly evaluated fo...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...