17543 search results - page 177 / 3509 » Stochastic Optimization Algorithms |
200
click to vote
ICML
2001
IEEE
16 years 7 months ago
2001
IEEE
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
158
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
164
click to vote
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
141
click to vote
QUESTA
1998
15 years 6 months ago
1998
We consider optimal policies for reentrant queues in which customers may be served several times at the same station. We show that for tandem reentrant queues the lastbuffer-fir...
181
click to vote
JMLR
2010
15 years 4 months ago
2010
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...