2168 search results - page 224 / 434 » Randomized Algorithms and Complexity Theory |
134
click to vote
COLT
2000
Springer
15 years 8 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
123
click to vote
TIT
2002
15 years 3 months ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
132
click to vote
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
122
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
242
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...