478 search results - page 43 / 96 » A simple expected running time analysis for randomized |
118
click to vote
HICSS
2002
IEEE
15 years 10 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...
117
Voted
JMLR
2011
15 years 15 days 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...
137
click to vote
APLAS
2009
ACM
16 years 2 days 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...
143
click to vote
ICASSP
2008
IEEE
16 years 12 hour 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...
124
click to vote
ICML
2003
IEEE
16 years 6 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...