10182 search results - page 1699 / 2037 » Case Studies |
158
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
184
click to vote
NIPS
2007
15 years 8 months ago
2007
We present four new reinforcement learning algorithms based on actor-critic and natural-gradient ideas, and provide their convergence proofs. Actor-critic reinforcement learning m...
154
click to vote
NIPS
2007
15 years 8 months ago
2007
Recent experimental studies have focused on the specialization of different neural structures for different types of instrumental behavior. Recent theoretical work has provided no...
197
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
198
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...