74 search results - page 9 / 15 » Random Debaters and the Hardness of Approximating Stochastic... |
101
click to vote
UAI
2004
15 years 17 days ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
NIPS
2003
15 years 17 days ago
2003
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
SODA
2012
ACM
13 years 1 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
RECOMB
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
ICC
2008
IEEE
15 years 5 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...