2434 search results - page 189 / 487 » Algorithmic Randomness of Closed Sets |
149
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
202
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
148
click to vote
CIARP
2004
Springer
15 years 9 months ago
2004
Springer
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
103
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We provide a natural learning process in which the joint frequency of empirical play converges into the set of convex combinations of Nash equilibria. In this process, al...
139
click to vote
NECO
2010
15 years 2 months ago
2010
Most conventional Policy Gradient Reinforcement Learning (PGRL) algorithms neglect (or do not explicitly make use of) a term in the average reward gradient with respect to the pol...