16404 search results - page 718 / 3281 » A set coverage problem |
172
Voted
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
We present a novel technique for automated problem decomposition to address the problem of scalability in reinforcement learning. Our technique makes use of a set of near-optimal ...
149
Voted
PODS
2006
ACM
16 years 7 months ago
2006
ACM
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
191
click to vote
ALT
2004
Springer
16 years 4 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
183
Voted
WOWMOM
2009
ACM
16 years 1 months ago
2009
ACM
Distributed estimation of global parameters in intermittently connected mobile environments is a challenging problem. In this paper, we introduce a set of methods, based on gossip...
168
Voted
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— This article studies the robust tracking control problem in nonminimum phase DC-DC nonlinear switched power converters. The proposed procedure introduces a stable inversion-bas...