9176 search results - page 1784 / 1836 » algorithms 2010 |
157
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
148
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
143
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
170
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract: A Mobile Adhoc Network (manet) is a cooperative engagement of a collection of mobile nodes without any centralized access point. The underlying concept of coordination am...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...