4894 search results - page 492 / 979 » The Guarding Problem - Complexity and Approximation |
170
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
167
Voted
NIPS
2001
15 years 6 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
150
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
150
Voted
ALGORITHMICA
2010
15 years 5 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
165
Voted
JMLR
2006
15 years 5 months ago
2006
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...